<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 int read() {
  int x = 0, flag = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * flag;
}
double calc(double b, double h) {
  double dlen = sqrt(b * b + h * h);
  return b * h / dlen;
}
int main() {
  double h, w, r;
  cin >> r;
  for (w = 1; w <= 10; ++w)
    for (h = 1; h <= 10; ++h)
      if (abs(r - calc(w / 2, h)) <= 1e-6) {
        cout << w << " " << h << endl;
        return 0;
      }
  return 0;
}
