<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>
int main() {
  double r, rr;
  scanf(" %lf", &r);
  double delta = -1;
  int x, y;
  for (int b = 1; b <= 10; b++) {
    for (int a = 1; a <= 10; a++) {
      double i = a, j = b, k;
      i /= 2.0;
      k = sqrt(i * i + j * j);
      rr = i * j / k;
      if (delta < 0.0 || fabs(r - rr) < delta) {
        x = a, y = b;
        delta = fabs(r - rr);
      }
    }
  }
  printf("%d %d\n", x, y);
  return 0;
}
