<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 long long INF = 1000000007;
double solve(double a, double h) {
  if (sqrt((a / 2.0) * (a / 2.0) + h * h) < 0.000000000001)
    return 100000000000.0;
  else
    return (a / 2.0 * h) / (sqrt((a / 2.0) * (a / 2.0) + h * h));
}
int main() {
  int a, h;
  double p;
  scanf("%lf", &p);
  bool can = 0;
  for (int a = 1; a <= 10; a++) {
    for (int h = 1; h <= 10; h++) {
      if (abs(solve((long double)a, (long double)h) - p) < 0.0000005) {
        printf("%d %d\n", a, h);
        can = 1;
        break;
      }
    }
    if (can) break;
  }
}
