<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.0);
double L(double a, double h, double r) {
  return r * (h + r) * (a + sqrt(a * a + 4 * h * h));
}
double R(double a, double h, double r) { return (h + r) * (h + r) * a; }
int main() {
  double r;
  cin >> r;
  double d = 100.0;
  int resa = -1, resh = -1;
  for (int a = 1; a <= 10; a++) {
    for (int h = 1; h <= 10; h++) {
      double lhs = L(a, h, r);
      double rhs = R(a, h, r);
      if (d >= fabs(lhs - rhs)) {
        d = fabs(lhs - rhs);
        resa = a;
        resh = h;
      }
    }
  }
  cout << resa << " " << resh << endl;
  return 0;
}
