<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 r;
int a, h;
bool found = 0;
int main() {
  cin >> r;
  for (int i = 1; i <= 10 && !found; i++) {
    for (int j = 1; j <= 10 && !found; j++) {
      if (abs(1.0 * i / 2 * j / (sqrt((1.0 * i / 2) * (1.0 * i / 2) + j * j)) -
              r) < 1e-6) {
        a = i;
        h = j;
      }
    }
  }
  cout << a << " " << h;
}
