<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;
double x;
double best = 1e30;
int ba, bh;
int main() {
  scanf("%lf", &x);
  for (int a = 1; a <= 10; a++)
    for (int h = 1; h <= 10; h++) {
      double C = sqrt(h * h + a * a / 4.0);
      double y = (C * C + h * h - a * a / 4.0) / (2.0 * C);
      double r = sqrt(h * h - y * y);
      if (fabs(r - x) < best) {
        best = fabs(r - x);
        ba = a;
        bh = h;
      }
    }
  printf("%d %d\n", ba, bh);
  return 0;
}
