Problem: 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

Solution (in PYTHON3):

Solution:
x=int(input())
arr=[1]
while x!=1:
    if x%2==0:
        arr.append(2)
        x//=2
        continue
    for i in range(3,10**6+9,2):
        if x%i==0:
            arr.append(i)
            x//=i
            break
    else:
        arr.append(x)
        x=1
        
while arr.count(1)!=0:
    del(arr[arr.index(1)])
    
arr.sort()
d=list(set(arr))
p=[]
for i in range(len(d)):
    p.append(d[i]**arr.count(d[i]))
    
d=[]
for i in range(len(p)+1):d.append(0)
q1=10**12;q2=10**12
while d[-1]!=1:
    a=1;b=1
    for i in range(len(d)-1):
        if d[i]==1:
            a*=p[i]
        else:
            b*=p[i]
    if max(a,b)<max(q1,q2):
        q1=a;q2=b
    d[0]+=1
    for i in range(len(d)-1):
        if d[i]==2:
            d[i]=0
            d[i+1]+=1
        else:
            break
print(q1,q2)