<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 a, h;
double x;
int get1, get2;
int main() {
  scanf("%lf", &x);
  for (int i = 1; i <= 10; i++)
    for (int j = 1; j <= 10; j++) {
      a = i * 1.0, h = j * 1.0;
      double V = a * a / 4.0 * h;
      double H = sqrt(a * a / 4.0 + h * h);
      double S = a * H / 2.0;
      double D = V / S;
      if (fabs(D - x) <= 1e-5) get1 = i, get2 = j;
    }
  printf("%d %d\n", get1, get2);
  return 0;
}
