<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;
const int N = 5e6 + 5;
const long long inf = 1791791791;
const long long mod = 1e9 + 7;
double x(double a, double h) {
  a = a / 2.0;
  double c = sqrt(a * a + h * h);
  return (a * h) / c;
}
int main() {
  double f;
  scanf("%lf", &f);
  for (int a = 1; a <= 10; a++) {
    for (int h = 1; h <= 10; h++) {
      if (fabs(f - x(a, h)) < 0.0001) {
        printf("%d %d\n", a, h);
        return 0;
      }
    }
  }
  return 0;
}
