<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;
inline bool EQ(double a, double b) { return fabs(a - b) < 0.0001; }
const int INF = 1 << 29;
int main() {
  double x;
  scanf("%lf", &x);
  for (int a = (1); a <= (10); ++a)
    for (int h = (1); h <= (10); ++h) {
      double s1 = a / 2.0;
      double s2 = h;
      double p = sqrt(s1 * s1 + s2 * s2);
      double V = s1 * s2 / 2;
      double r = V / p * 2;
      if (EQ(r, x)) {
        printf("%d %d\n", a, h);
        return 0;
      }
    }
  abort();
  return 0;
}
