<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 ii = tuple<long long, long long>;
const long long N = 2e5 + 10, inf = 1e9 + 42;
long long binpow(long long a, long long b) {
  if (b == 0) return 1;
  long long res = binpow(a, b / 2);
  if (b % 2)
    return (res * res * a) % 1000000007;
  else
    return (res * res) % 1000000007;
}
bool compare(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first == b.first)
    return (a.second > b.second);
  else
    return (a.first <= b.first);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  double a[11][11];
  for (long long i = 1; i < 11; i++) {
    for (long long j = 1; j < 11; j++) {
      a[i][j] = ((i * j) / (sqrt(i * i + 4 * j * j)));
    }
  }
  double x;
  cin >> x;
  for (long long i = 1; i < 11; i++) {
    for (long long j = 1; j < 11; j++) {
      if (abs(x - a[i][j]) < 0.000001) {
        cout << i << " " << j << endl;
        return 0;
      }
    }
  }
}
