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
n = input()
k = 2
primes = [1]
ans = [1, n]
ps = [[1, 1]]
qh, qe = 0, 1
p = []
while k * k <= n:
    if n % k == 0:
        t = 1
        while n % k == 0:
            n /= k
            t *= k
        p.append(t)
    k += 1
if n > 1:
    p.append(n)
for t in p:
    while qh < qe:
        x, y = ps[qh]
        qh += 1
        ps.append([x, y * t])
        ps.append([x * t, y])
        if t == p[-1]:
            for x in ps[-2:]:
                if max(ans) > max(x):
                    ans = x
    qe = len(ps)
print ans[0], ans[1]
