<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;
void solve() {
  int prod = 1000111;
  int savea = 10, saveh = 10;
  for (int a = (1), _b = (10); a <= _b; a++)
    for (int h = (1), _b = (10); h <= _b; h++) {
      double area = a * h;
      double hyp = sqrt(4 * h * h + a * a);
      double r = area / hyp;
      if (abs(r - x) <= 1e-6) {
        cout << a << ' ' << h << endl;
        return;
      }
    }
}
int main() {
  ios ::sync_with_stdio(false);
  while (cin >> x) {
    solve();
  }
  return 0;
}
