<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>
double e, ee, ei, ej, m;
double gg(double p, double q) {
  p /= 2;
  double r = sqrt(p * p + q * q);
  return p * q / r;
}
int main() {
  scanf("%lf", &m);
  e = 999999;
  double i, j;
  for (i = 1; i <= 10; i++)
    for (j = 1; j <= 10; j++) {
      if (e > abs(m - gg(i, j))) {
        e = abs(m - gg(i, j));
        ei = i;
        ej = j;
      }
    }
  printf("%.0lf %.0lf\n", ei, ej);
}
