<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>
int main() {
  double r;
  scanf("%lf", &r);
  int D, d;
  for (D = 1; D <= 10; D++) {
    for (d = 2; d <= 20; d += 2) {
      double res = ((double)(D) * (double)(d)) /
                   (4.0 * sqrt(((double)(D) / 2.0) * ((double)(D) / 2.0) +
                               ((double)(d) / 2.0) * ((double)(d) / 2.0)));
      if (fabs(res - r) < 1E-5) {
        printf("%d %d\n", D, d / 2);
        return 0;
      }
    }
  }
  return 0;
}
