<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;
double x;
int main() {
  int ax, ay;
  cin >> x;
  double eps = 1e-6;
  for (int i = 1; i <= 10; i++)
    for (int j = 1; j <= 10; j++) {
      double y = sqrt(i * 1.0 / 4 * i * j * j / (i * 1.0 / 4 * i + j * j));
      if (fabs(y - x) < eps) {
        eps = fabs(y - x);
        ax = i;
        ay = j;
      }
    }
  cout << ax << " " << ay << endl;
  return 0;
}
