<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() {
  float n;
  int a, h;
  scanf("%f", &n);
  for (a = 1; a < 11; a++) {
    for (h = 1; h < 11; h++) {
      if (fabs((float)a * h * 0.5 / sqrt((float)a * a * 0.25 + (float)h * h) -
               n) <= 0.00001) {
        printf("%d %d\n", a, h);
        return 0;
      }
    }
  }
  return 0;
}
