<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 r;
  scanf("%lf", &r);
  for (int a = (1); a <= (10); ++a)
    for (int h = (1); h <= (10); ++h) {
      double rr = 0.5 * a * h / sqrt(0.25 * a * a + h * h);
      if (fabs(r - rr) < 1e-5) {
        printf("%d %d\n", a, h);
        return 0;
      }
    }
  return 0;
}
