<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;
using namespace std::chrono;
const int N = 16005;
const int K = 605;
const long long InfL = 1000000000000000000LL;
const int MOD = 1000000007;
int main() {
  long long X = 0;
  string s;
  cin >> s;
  for (auto i : s)
    if (i != '.') X = X * 10 + i - '0';
  auto Abs = [](long long a) { return a < 0 ? -a : a; };
  for (long long a = 10; a >= 1; --a) {
    for (long long h = 10; h >= 1; --h) {
      if (Abs(a * a * h * h * 1000000 * 1000000 -
              X * X * (a * a + 4 * h * h)) <= 10000000000) {
        cout << a << " " << h << endl;
        return 0;
      }
    }
  }
  return 0;
}
