<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>
int main() {
  double x;
  scanf("%lf", &x);
  for (int a = 1; a <= 10; ++a) {
    for (int h = 1; h <= 10; ++h) {
      double sq_a = (0.5 * a) * (0.5 * a);
      double sq_h = h * h;
      double y = sqrt((sq_a * sq_h) / (sq_a + sq_h));
      if (x - y <= 1e-6 && x - y >= -1e-6) {
        printf("%d %d\n", a, h);
        return 0;
      }
    }
  }
  return 0;
}
