<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;
int main(int argc, char *argv[]) {
  double table[11][11];
  for (int a = 1; a <= 10; ++a) {
    for (int b = 1; b <= 10; ++b) {
      double ah = (double)a / 2;
      double ans = ah * b / sqrt(ah * ah + b * b);
      table[a][b] = ans;
    }
  }
  double in;
  cin >> in;
  for (int a = 1; a <= 10; ++a) {
    for (int b = 1; b <= 10; ++b) {
      if (abs(in - table[a][b]) < 1e-6) {
        printf("%d %d\n", a, b);
        return 0;
      }
    }
  }
  return 0;
}
