Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(a, b) such that LCM(a, b) equals X. Both a and b should be positive integers.

LCM(a, b) is the smallest positive integer that is divisible by both a and b. For example, LCM(6, 8) = 24, LCM(4, 12) = 12, LCM(2, 3) = 6.

Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?

Input

The first and only line contains an integer X (1 ≤ X ≤ 10^{12}).

Output

Print two positive integers, a and b, such that the value of max(a, b) is minimum possible and LCM(a, b) equals X. If there are several possible such pairs, you can print any.

Examples

Input


2


Output


1 2


Input


6


Output


2 3


Input


4


Output


1 4


Input


1


Output


1 1
import itertools

x = int(input())
x0 = x
i = 2

d = 2
last_pr = 1

divs = []
while d * d <= x:
    if x % d == 0:
        x = x // d
        last_pr *= d
    else:
        if last_pr != 1:
            divs.append(last_pr)
        last_pr = 1
        d += 1

if d == x and last_pr * x != 1:
    divs.append(last_pr* x)
else:
    if last_pr != 1:
        divs.append(last_pr)
    if x != 1:
        divs.append(x)

m = x0
ma = 1
mb = x0

for i in range(len(divs) + 1):
    combs = itertools.combinations(divs, i)
    for comb in combs:
        a = 1
        b = 1
        for d in divs:
            if d in comb:
                a *= d
            else:
                b *= d
        if max(a, b) < m:
            m = max(a, b)
            ma = a
            mb = b

print(ma, mb)
