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
# cook your dish here
def B(n,arrr):  
    a= bin(n).replace("0b", "")  
    b='0'*(len(arrr)-len(a))+a
    return b
def product(bi,arrr):
    pro=1
    for i in range(len(arrr)):
        if bi[i]=='1':
            pro=pro*arrr[i]
    return pro
            
x=int(input())
x1=x
m=0
ans=x1
arr=[]
for i in range(2,int(x1**0.5)+1):
    
    if x%i==0:
        y=1
        while x%i==0:
            x=x//i
            y=y*i
        arr.append(y)
    
for i in range(1,2**len(arr)):
    p=product(B(i,arr),arr)
    q=x1//p
    m=max(p,q)
    ans=min(m,ans)
print(ans,x1//ans)
    
    
    
    


    