<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>
inline int Max(int a, int b) { return a > b ? a : b; }
inline int Min(int a, int b) { return a < b ? a : b; }
inline int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }
inline int bit(int x) { return (int)log10((double)x) + 1; }
inline int lowbit(int x) { return x & -x; }
inline int highbit(int x) {
  while (x != lowbit(x)) x ^= lowbit(x);
  return x;
}
inline int whichbit(int x) {
  int ret = 0;
  while (x > 1) {
    x >>= 1;
    ret++;
  }
  return ret;
}
using namespace std;
const double pi = M_PI;
const int inf = 1000000007;
const int mod = 10000;
const double eps = 1e-6;
const int maxn = (1 << 15) + 5;
const int maxm = 1005;
const int maxe = maxn * 4;
int main() {
  double x;
  scanf("%lf", &x);
  int flag = 0;
  for (int i = 1; i <= 10; i++) {
    for (int j = 1; j <= 10; j++) {
      double a = (double)i;
      double h = (double)j;
      a /= 2.0;
      double s = a * h / sqrt(a * a + h * h);
      if (fabs(x - s) < 0.0001) {
        flag = 1;
        printf("%d %d\n", i, j);
        break;
      }
    }
    if (flag) break;
  }
  return 0;
}
