<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 double pi = acos(-1);
const double tau = 2 * pi;
const double epsilon = 1e-6;
double R;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> R;
  double mnDiff = INFINITY;
  int bestA = -1, bestH = -1;
  for (int a = 1; a <= 10; a++)
    for (int h = 1; h <= 10; h++) {
      double da = double(a), dh = double(h);
      double curR = da * dh / (2.0 * sqrt((da / 2.0) * (da / 2.0) + dh * dh));
      if (abs(curR - R) < mnDiff) {
        mnDiff = abs(curR - R);
        bestA = a;
        bestH = h;
      }
    }
  cout << bestA << ' ' << bestH << '\n';
  return 0;
}
