<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>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
template <class T>
T gcd(T x, T y) {
  while (T t = x % y) x = y, y = t;
  return y;
}
const double eps = 1e-9;
const double PI = acos(-1.);
const int INF = 1000000000;
const int MOD = 1000000007;
const double E = 2.7182818284590452353602874713527;
bool isdig(char x) { return x >= '0' && x <= '9'; }
bool isup(char x) { return x >= 'A' && x <= 'Z'; }
bool isdown(char x) { return x >= 'a' && x <= 'z'; }
bool islet(char x) { return isup(x) || isdown(x); }
double ff;
void get_data() { cin >> ff; }
void run() {
  double wc = -1;
  int ai = -1, aj;
  for (int i = 1; i <= 10; i++) {
    for (int j = 1; j <= 10; j++) {
      double ans = i * j / sqrt(i * i + 4 * j * j * 1.);
      double twc = abs(ans - ff);
      if (ai == -1 || twc < wc) {
        ai = i;
        aj = j;
        wc = twc;
      }
    }
  }
  cout << ai << ' ' << aj << endl;
}
int main() {
  {
    get_data();
    run();
  }
  return 0;
}
