<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>
double radius(double a, double h) {
  double cosAlpha = sqrt(4 * h * h / (a * a + 4 * h * h));
  double radius = a / 2 * cosAlpha;
  return radius;
}
int main() {
  double etalon;
  std::cin >> etalon;
  for (int h = 1; h <= 10; ++h) {
    for (int a = 1; a <= 10; ++a) {
      if (fabs(radius(a, h) - etalon) < 1e-6) {
        std::cout << a << " " << h << std::endl;
        return 0;
      }
    }
  }
  return 0;
}
