<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;
int p, q, i, j, o;
double A, B, C, D;
char s1[1005], s2[1005];
struct node {
  double x;
  int y, z;
} ans[10005];
int cmp(node i, node j) { return i.x < j.x; }
int main() {
  scanf("%lf", &A);
  for (i = 1; i <= 10; i++)
    for (j = 1; j <= 10; j++) {
      B = i / 2.0;
      C = j;
      D = sqrt(B * B + C * C);
      ans[++o].x = fabs(B * C / D - A);
      ans[o].y = i;
      ans[o].z = j;
    }
  sort(ans + 1, ans + o + 1, cmp);
  cout << ans[1].y << ' ' << ans[1].z << endl;
  return 0;
}
