<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 PI = 3.14159;
double n;
bool f(double a, double b) {
  double ss = a * b / 2 / sqrt((a / 2 * a / 2) + (b * b));
  return abs(ss - n) < 1e-6;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= 10; i++) {
    for (int j = 1; j <= 10; j++) {
      if (f(i, j)) {
        cout << i << " " << j << endl;
        return 0;
      }
    }
  }
  return 0;
}
