<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;
double rad[11][11];
int main() {
  double x;
  cin >> x;
  for (int i = 1; i <= 10; i++)
    for (int j = 1; j <= 10; j++)
      rad[i][j] = (i * j / 2.0) / sqrt(i * i + j * j / 4.0);
  int ai = 1;
  int aj = 1;
  for (int i = 1; i <= 10; i++)
    for (int j = 1; j <= 10; j++)
      if (abs(x - rad[i][j]) < abs(x - rad[ai][aj])) ai = i, aj = j;
  cout << aj << ' ' << ai << '\n';
}
