<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>
#pragma comment(linker, "/stack:16777216")
using namespace std;
const int INF = 1000000000;
const int MOD = 1000000007;
int main() {
  double c;
  cin >> c;
  for (int a = (1); a < (11); ++a)
    for (int b = (1); b < (22); ++b)
      if (b % 2 == 0 &&
          abs(0.5 * sqrt(1.0 * a * a * b * b / (1.0 * a * a + b * b)) - c) <
              1e-6) {
        cout << a << ' ' << b / 2 << endl;
        return 0;
      }
}
