<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>
#pragma warning(disable : 4996)
using namespace std;
int dcmp(double x) { return (x > 1e-4) - (x < -1e-4); }
int main() {
  double x;
  bool flag = false;
  while (cin >> x) {
    for (int i = 1; i <= 10 && !flag; i++) {
      for (int j = 1; j <= 10 && !flag; j++) {
        double k = i / 2.0;
        double dd = sqrt(k * k + j * j + .0);
        dd = k * j / dd;
        if (dcmp(dd - x) == 0) {
          cout << i << " " << j << endl;
          flag = true;
          break;
        }
      }
    }
  }
  return 0;
}
