<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 R;
bool check(double x, double y) {
  x /= 2;
  if (fabs(x * y * sqrt(x * x + y * y) / (x * x + y * y) - R) <= eps) return 1;
  return 0;
}
int main() {
  scanf("%lf", &R);
  for (int i = 1; i <= 10; ++i)
    for (int j = 1; j <= 10; ++j)
      if (check(i, j)) {
        cout << i << " " << j << endl;
        return 0;
      }
  return 0;
}
