<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;
template <typename T>
inline T Abs(T a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
const int INF = (int)1E9;
const long double EPS = 1E-6;
const long double PI = 3.1415926535897932384626433832795;
void solve() {
  double x;
  cin >> x;
  for (int a = 1; a <= 10; a++)
    for (int h = 1; h <= 10; h++) {
      double v = a * h / sqrt(a * a + 4.0 * h * h);
      if (fabs(v - x) < 1e-5) {
        cout << a << " " << h << endl;
        return;
      }
    }
}
int main() {
  solve();
  return 0;
}
