<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
import sys
from math import sqrt, pi

X = float(input())

def rad_len(a, h, c):
    x = c * a/2
    # y = c * sqrt((a / 2)**2 + h**2)
    y = c * h
    return sqrt((x - a/2)**2 + (y - 0)**2)

def get_max_radius(a, h):
    lo = 0.0
    hi = 1.0

    while abs(lo - hi) > 1e-9:
        # print(lo, hi, rad_len(a, h, lo), rad_len(a, h, hi))

        p = lo + (hi - lo) / 3
        q = lo + 2 * (hi - lo) / 3

        if rad_len(a, h, p) > rad_len(a, h, q):
            lo = p
        else:
            hi = q

    # for cx in range(100 + 0):
    #     print(rad_len(a, h, cx / 100.0))

    return rad_len(a, h, lo)

for i in range(9, -1, -1):
    for ai in range(1, 11):
        for hi in range(1, 11):
            a = float(ai)
            h = float(hi)
            r = get_max_radius(a, h)

            if abs(r - X) < 10**(-i):
                print(ai, hi)
                sys.exit(0)


