<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 double pi = acos(-1);
int main() {
  double x, a, h;
  cin >> x;
  for (int i = 1; i <= 10; i++)
    for (int j = 1; j <= 10; j++) {
      if (i < 2 * x) continue;
      double y = 1 / sqrt(4.0 / (i * i) + 1.0 / (j * j));
      int xx = (int)(x * 10000000);
      int yy = (int)(y * 10000000);
      if ((abs(xx - yy) <= 5)) {
        cout << i << ' ' << j;
        return 0;
      }
    }
}
