<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 void R(int &x) {
  char ch = getchar();
  x = 0;
  for (; ch < '0'; ch = getchar())
    ;
  for (; ch >= '0'; ch = getchar()) x = x * 10 + ch - '0';
}
const int N = 100005;
double a;
double sqr(double x) { return x * x; }
double Abs(double x) { return x < 0 ? -x : x; }
bool check(int i, int j) {
  double l = sqrt(sqr(0.5 * i) + sqr(j));
  double b = 0.5 * i * j / l;
  if (Abs(a - b) < 1e-5) return 1;
  return 0;
}
int main() {
  scanf("%lf", &a);
  for (int i = 1; i <= 10; ++i)
    for (int j = 1; j <= 10; ++j)
      if (check(i, j)) {
        printf("%d %d\n", i, j);
        return 0;
      }
  return 0;
}
