<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;
double eps = 1E-6;
double V(double a, double h) {
  return h * a / (2 * sqrt((a * a / 4.0) + h * h));
}
int main() {
  double x;
  scanf("%lf", &x);
  int i, j;
  for (i = 1; i <= 10; ++i)
    for (j = 1; j <= 10; ++j)
      if (fabs(V(i, j) - x) < eps) {
        printf("%d %d\n", i, j);
        return 0;
      }
}
