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
def getbit(n,k):
    return (n & (1 <<k)) >> k
x = int(input())
a = []
for i in range(2,int(x ** 0.5) + 2):
    if x % i == 0:
        c = 0
        while x % i == 0:
            x //= i
            c += 1
        a.append(i ** c)
if x != 1:
    a.append(x)
ans = [21674627468627481,0]
for mask in range(1 << len(a)):
    n1 = 1
    n2 = 1
    for i in range(len(a)):
        if getbit(mask, i):
            n1 *= a[i]
        else:
            n2 *= a[i]
    if max(ans) > max(n1,n2):
        ans = [n1,n2]
print(*ans)
