<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;
static const double EPS = 1e-7;
template <typename T, typename S>
vector<T>& operator<<(vector<T>& a, S b) {
  a.push_back(b);
  return a;
}
template <typename T>
void operator>>(vector<T>& a, int b) {
  while (b--)
    if (!a.empty()) a.pop_back();
}
bool isprime(int n) {
  if (n < 2) return false;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
long long b_pow(long long x, long long n) {
  return n ? b_pow(x * x, n / 2) * (n % 2 ? x : 1) : 1ll;
}
string itos(int n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
int main() {
  double x;
  cin >> x;
  double vol = 1e18;
  int a, h;
  for (int i = 1; i <= 10; i++) {
    for (int j = 1; j <= 10; j++) {
      double s = 1. / 3 * i * i * j;
      double A = 1. * sqrt(2) / i;
      double B = 1. * sqrt(2) / i;
      double C = 1. / j;
      double R = 1. / sqrt(A * A + B * B + C * C);
      if (fabs(R - x) < vol) {
        vol = fabs(R - x);
        a = i;
        h = j;
      }
    }
  }
  cout << a << " " << h << endl;
}
