<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, h;
double r;
int dcmp(double x) { return (x > 1e-6) - (x < -1e-6); }
int main() {
  while (cin >> r) {
    int ok = 0;
    for (a = 1; a <= 10; a++) {
      for (h = 1; h <= 10; h++) {
        if (dcmp((a * h) / sqrt(a * a + 4 * h * h) - r) == 0) {
          cout << a << ' ' << h << endl;
          ok = 1;
          break;
        }
      }
      if (ok == 1) break;
    }
  }
  return 0;
}
