<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 = 1e-6;
int l, h;
double r, ans;
int main() {
  scanf("%lf", &r);
  for (l = 1; l <= 10; l++) {
    for (h = 1; h <= 10; h++) {
      ans = l / 2.0 * h / sqrt(h * h + l / 4.0 * l);
      if (fabs(r - ans) < eps) {
        printf("%d %d\n", l, h);
        return 0;
      }
    }
  }
  return 0;
}
