<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>
const double eqs = 1e-6;
int main() {
  int i, j, k;
  double s, a, h, p, q;
  scanf("%lf", &s);
  for (i = 1; i <= 10; i++) {
    for (j = 1; j <= 10; j++) {
      a = i / 2.0;
      h = j * 1.0;
      p = sqrt((a * a + h * h));
      q = a * h / p;
      if (q <= s + eqs && q >= s - eqs) {
        printf("%d %d\n", i, j);
        break;
      }
    }
    if (j != 11) break;
  }
  return 0;
}
