<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 sq(double a) { return a * a; }
double dabs(double a) { return a < 0 ? -a : a; }
bool eq(double a, double b) { return dabs(a - b) < 0.00001; }
int main() {
  double r;
  cin >> r;
  for (int a = 1; a <= 10; a += 1) {
    for (int h = 1; h <= 10; h += 1) {
      if (r > a / 2.0) continue;
      if (!eq(1 / sq(r), 4 / sq(a) + 1 / sq(h))) continue;
      cout << a << " " << h << endl;
      return 0;
    }
  }
  return 0;
}
