<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 eps = 1e-5;
double r, Min = 100000;
int ans1, ans2;
int main() {
  cin >> r;
  for (int b = 1; b <= 10; b++)
    for (int z = 1; z <= 10; z++) {
      double a = (double)z / 2;
      double c = sqrt(b * b + (double)a * a);
      double tt = a * b / c - r;
      if (tt > -eps && tt < Min) {
        Min = tt;
        ans1 = z;
        ans2 = b;
      }
    }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
