<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() {
  int i1, i2;
  double l, t, e = 0.00003;
  scanf("%lf", &l);
  for (i1 = 1; i1 <= 10; i1++) {
    for (i2 = 1; i2 <= 10; i2++) {
      t = sqrt(((double)i1 / 2) * ((double)i1 / 2) + i2 * i2) * l -
          ((double)i1 / 2) * i2;
      if (t < e && t > (-1) * e) {
        printf("%d %d", i1, i2);
        i1 = 11;
        i2 = 11;
      }
    }
  }
  return 0;
}
