<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;
const double eps = 3e-5;
double x, H, L;
int main() {
  scanf("%lf", &x);
  for (register double H = 1; H <= 10.0 + eps; H += 1) {
    if (H + eps < x) continue;
    L = H / sqrt((H * H) / (x * x) - 1) * 2;
    for (register double q = 1; q <= 10.0 + eps; q += 1)
      if (max(L - q, q - L) < eps) {
        printf("%d %d\n", (int)q, (int)H);
        return 0;
      }
  }
}
