<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 double eps = 1e-5;
bool check(int a, int b, double x) {
  double s = a * b / 2.0, c = sqrt(a * a / 4.0 + b * b);
  return (fabs((x * c) - (s)) < eps);
}
void solve(double x) {
  int l = (int)ceil(x * 2.0), r = (int)ceil(x), i, j;
  for (i = l; i < 11; ++i) {
    for (j = r; j < 11; ++j) {
      if (check(i, j, x)) {
        printf("%d %d\n", i, j);
        return;
      }
    }
  }
}
int main() {
  double x;
  while (~scanf("%lf", &x)) {
    solve(x);
  }
  return 0;
}
