<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;
const int MAX_N = 15;
const double eps = 1e-6;
double mp[MAX_N][MAX_N];
bool dcmp(double k) {
  if (k < 0) k = -k;
  if (k < eps) return 1;
  return 0;
}
void init() {
  for (int i = 1; i <= 10; i++)
    for (int j = 1; j <= 10; j++) {
      double p = i;
      double q = j;
      mp[i][j] = (p * q) / sqrt(4 * p * p + q * q);
    }
}
void do_it() {
  double ans;
  cin >> ans;
  for (int i = 1; i <= 10; i++)
    for (int j = 1; j <= 10; j++)
      if (dcmp(mp[i][j] - ans)) {
        printf("%d %d\n", j, i);
        return;
      }
  return;
}
int main() {
  init();
  do_it();
  return 0;
}
