<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 int INF = 1000000009;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int MAXN = 1003;
const int MAXM = 0;
const int mod = 1000000007;
int i, n;
long long p[1001];
long long d[1001];
string s1, s2;
string c1, c2;
double a, b;
int main() {
  double p;
  cin >> p;
  for (a = 1; a <= 10; a++)
    for (b = 1; b <= 10; b++) {
      double x = atan(a / (b / 2));
      double t = b / 2 * sin(x);
      if (fabs(t - p) < 1e-5) {
        cout << b << " " << a << endl;
        return 0;
      }
    }
  return 0;
}
