<image>

Input

The input contains a single floating-point number x with exactly 6 decimal places (0 < x < 5).

Output

Output two integers separated by a single space. Each integer should be between 1 and 10, inclusive. If several solutions exist, output any of them. Solution will exist for all tests.

Examples

Input

1.200000


Output

3 2


Input

2.572479


Output

10 3


Input

4.024922


Output

9 9
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 17;
const double eps = 1e-5;
double n;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i < 11; i++)
    for (int j = 1; j < 11; j++)
      if (abs(1. * i * j / sqrt(i * i + 4 * j * j) - n) <= eps) {
        cout << i << " " << j << endl;
        return 0;
      }
  return 0;
}
