<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 x;
  scanf("%lf", &x);
  double diff = 12345;
  int da = -1, db = -1;
  for (int a = 1; a <= 10; a++)
    for (int b = 1; b <= 10; b++) {
      double u = (a * b) / sqrt(4 * a * a + b * b);
      u = fabs(u - x);
      if (u < diff) {
        diff = u;
        da = b;
        db = a;
      }
    }
  printf("%d %d\n", da, db);
  return 0;
}
