<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 a, b, z;
double r(double a, double h) {
  a /= 2;
  double c = a * a + h * h;
  c = sqrt(c);
  return a * h / c;
}
void doit() {
  for (int i = 1; i < 11; i++)
    for (int j = 1; j < 11; j++)
      if (fabs(r(i, j) - z) < 1e-6) {
        cout << i << " " << j << endl;
        return;
      }
}
int main() {
  cin >> z;
  doit();
  return 0;
}
