<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;
void run() {
  double want;
  scanf("%lf", &want);
  for (int a = (1); a <= (10); ++a)
    for (int h = (1); h <= (10); ++h) {
      double have = a * h / sqrt(4.0 * h * h + a * a);
      if (fabs(have - want) < 1e-5) {
        printf("%d %d\n", a, h);
        return;
      }
    }
  assert(false);
}
int main() {
  run();
  return 0;
}
