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())
orig = n
factors = [1]
while n%2==0:
    factors[0]*=2
    n//=2
if factors[0]==1:
    factors.pop()
c = 3
while c*c<n:
    if n%c==0:
        factors.append(1)
        while n%c==0:
            factors[-1]*=c
            n//=c
    c+=2
if n>1:
    factors.append(n)
def func(i,cut):
    if i==-1:
        return 1 if cut<=1 else float('inf')
    a1 = func(i-1,cut)
    a2 = func(i-1,cut/factors[i])*factors[i]
    return min(a1,a2)
x = func(len(factors)-1,orig**(1/2))
print(orig//x,x)
