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())
p=n
ans={}
a=[]
for i in range(2,int(n**0.5)+1):
    if p%i==0:
        ans[i]=0
        while(p%i==0):
            p//=i
            ans[i]+=1
        a.append(i**ans[i])
if p!=1:
    ans[p]=1
    a.append(p)
#print(ans)
#print(a)
if len(a)==1:print(1,n)
else:
    mmax=[n,1,n]
    for i in range(1,2**len(a)):
        tmp=1
        for j in range(len(a)):
            if (i&(1<<j)):
                tmp*=a[j]
        #print(tmp)  
        if mmax[0]>max(tmp,n//tmp):
            mmax=[max(tmp,n//tmp),tmp,n//tmp] 
    #print(mmax)
    print(mmax[1],mmax[2]) 




    

