<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;
int main() {
  int lol, a, h;
  double RR, r, aa, hh;
  while (scanf("%lf", &r) != EOF) {
    lol = 0;
    for (a = 1; a < 11; a += 1) {
      for (h = 1; h < 11; h += 1) {
        aa = double(a);
        hh = double(h);
        RR = hh * aa / 2 / (sqrt(hh * hh + aa * aa / 4));
        if (fabs(RR - r) < 1E-6) {
          lol = 1;
          cout << a << ' ' << h << endl;
          break;
        }
      }
      if (lol == 1) break;
    }
  }
  return 0;
}
