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 = int(input())
num = n
d = {}

while n % 2 == 0:
    d[2] = 2 if 2 not in d else d[2] * 2

    n //= 2
#print(n, int(math.sqrt(n)) + 1)
i = 3; ans = float('inf')

while i * i <= n:

    while n % i == 0:
        d[i] = i if i not in d else d[i] * i

        n //= i

    i += 2
    
if n > 2:
    d[n] = n
pf = list(d.items())

for i in range(1, 1 << len(pf)):
    p = 1
    for j in range(len(pf)):
        if i & (1 << j) > 0:
            p *= pf[j][1]
    #print(p)
    ans = min(ans, max(p, num // p))
if num == 1:
    print(1, 1)
else:
    print(num // ans, ans)
