<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 ans[66];
int mainh() {
  int a, b;
  cin >> a >> b;
  cout << (a | b) << endl;
  return 0;
}
int mainf() {
  int a;
  memset(ans, 0, sizeof(ans));
  ans[2] = 1, ans[4] = 2, ans[27] = 5, ans[42] = 6;
  while (~scanf("%d", &a)) {
    if (ans[a]) {
      printf("%d\n", ans);
      continue;
    }
    if (a > 55)
      while (1)
        ;
    int b = 2;
    for (int i = 1; i <= 10; ++i) {
      if (b >= a) {
        printf("%d\n", i);
        break;
      }
      b *= 2;
    }
  }
  return 0;
}
int dcmp(double x) { return (x > 1e-4) - (x < -1e-4); }
int main() {
  double x;
  while (cin >> x) {
    bool flag = false;
    for (int i = 1; i <= 10 && !flag; i++) {
      for (int j = 1; j <= 10 && !flag; j++) {
        double k = i / 2.0;
        double dd = sqrt(k * k + j * j + .0);
        dd = k * j / dd;
        if (dcmp(dd - x) == 0) {
          cout << i << " " << j << endl;
          flag = true;
        }
      }
    }
  }
  return 0;
}
