<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-5;
bool judge(int a, int b, double x) {
  return fabs(x * sqrt(1.0 * a * a + 4.0 * b * b) - a * b) < eps;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  double x;
  cin >> x;
  for (int a = 1; a < 11; ++a) {
    for (int b = 1; b < 11; ++b) {
      if (judge(a, b, x)) {
        printf("%d %d\n", a, b);
        return 0;
      }
    }
  }
  return 0;
}
