<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;
void fre() {
  freopen("c://test//input.in", "r", stdin);
  freopen("c://test//output.out", "w", stdout);
}
template <class T1, class T2>
inline void gmax(T1 &a, T2 b) {
  if (b > a) a = b;
}
template <class T1, class T2>
inline void gmin(T1 &a, T2 b) {
  if (b < a) a = b;
}
const int N = 0, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
const double eps = 1e-6;
int n, m;
double ans;
void solve() {
  for (int a = 1; a <= 10; ++a) {
    for (int h = 1; h <= 10; ++h) {
      double area = (a / 2.0 * h);
      double bot = sqrt(a * a / 4.0 + h * h);
      double tmp = area / bot;
      if (fabs(tmp - ans) < eps) {
        printf("%d %d\n", a, h);
        return;
      }
    }
  }
}
int main() {
  while (~scanf("%lf", &ans)) {
    solve();
  }
  return 0;
}
