<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 EPS = 1E-6;
double Heron(double a, double b, double c) {
  double p = (a + b + c) / 2.0;
  double S2 = p * (p - a) * (p - b) * (p - c);
  return sqrt(S2);
}
double solve(double a, double h) {
  double V_big = (a * a * h) / 3.0;
  double V_small = V_big / 4.0;
  double l = sqrt(a * a / 2.0 + h * h);
  double area = Heron(l, l, a);
  return (3.0 * V_small) / area;
}
int main() {
  double x;
  cin >> x;
  for (int a = 1; a <= 10; a++) {
    for (int h = 1; h <= 10; h++) {
      double temp = solve(a, h);
      if (abs(temp - x) < EPS) {
        cout << a << ' ' << h;
        goto fin;
      }
    }
  }
fin:
  return 0;
}
