<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;
int main() {
  double k;
  scanf("%lf", &k);
  for (int l = 1; l <= 10; l++)
    for (int h = 1; h <= 10; h++) {
      double kle =
          sqrt((double)(h * h * l * l * 1.00000 / (l * l + 4 * h * h)));
      if (kle > k + 0.000001 || kle < k - 0.000001) continue;
      printf("%d %d", l, h);
      return 0;
    }
}
