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
#Tuan_Kkura

def get_bit(val, id) :
    return (val >> id)&1

X = int(input())

tmp = X
val = []
for i in range(2, 1000001) :
    num = 1
    while X%i == 0 :
        X /= i
        num *= i
    if num > 1 : val.append(num)
if X > 1 : val.append(X)
#print(*val[0:])
resA = 10**12; resB = 10**12
n = len(val)
for state in range(0, (1<<n)) :
    A = 1; B = 1
    for i in range(0, n) :
        if get_bit(state, i) == 0 :
            A *= val[i]
        else : B *= val[i]
    if max(A, B) < max(resA, resB) :
        resA = A; resB = B
print(int(resA), int(resB))


