<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;
char s[1100];
int main() {
  int i, j;
  double ans;
  double a, b, c;
  scanf("%lf", &ans);
  for (i = 1; i <= 10; i++) {
    for (j = 1; j <= 10; j++) {
      a = i;
      b = j;
      a = a / 2.0;
      c = (a * b) / sqrt(a * a + b * b);
      if (fabs(ans - c) <= 0.000001) {
        printf("%d %d\n", i, j);
        return 0;
      }
    }
  }
  return 0;
}
