<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>
double a, b, r, R, pi = acos(-1.);
bool check(double a, double b) {
  double r = a * b / 2 / sqrt(b * b + a * a / 4);
  return fabs(r - R) < 1e-6;
}
int main() {
  scanf("%lf", &R);
  for (int i = 1; i <= 10; ++i)
    for (int j = 1; j <= 10; ++j)
      if (check(i, j)) {
        printf("%d %d\n", i, j);
        return 0;
      }
}
