<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;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long double x;
  cin >> x;
  long double DELTA__ = (long long)1e18;
  long double o, p;
  for (long double a = 1; a <= 10; a += 1)
    for (long double h = 1; h <= 10; h += 1)
      if (fabs(a * a * h * h / (a * a + 4 * h * h) - x * x) <= DELTA__) {
        DELTA__ = fabs(a * a * h * h / (a * a + 4 * h * h) - x * x);
        o = a;
        p = h;
      }
  cout << o << ' ' << p << '\n';
}
