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 rec(ind,cc=1,dd=1):
    global pp,a,b
    if ind==len(pp):
        if max(cc,dd)<max(a,b):
            a,b=cc,dd
        return
    rec(ind+1,cc*pp[ind],dd)
    rec(ind+1,cc,dd*pp[ind])
x=int(input())
p=[]
vis=[0 for i in range(10**6+4)]
vis[0]=1
vis[1]=1
for i in range(2,10**6+4):
    if vis[i]==0:
        p.append(i)
        vis[i::i]=len(vis[i::i])*[1]

    
pp=[]
ind=0
xx=x
while xx>1 and ind<len(p):
    co=1
    while xx%p[ind]==0:
        xx//=p[ind]
        co*=p[ind]
    ind+=1
    if co==1:
        continue
    pp.append(co)
        

if xx>1:
    pod=1
    for i in pp:
        pod*=i
    print(xx,pod)
elif x==1:
    print(1,1)
else:
    
    a=1
    b=x
    rec(0)
    print(a,b)
