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:
import math
# hello
# bros
# this
# is 
#my 
# code
def check1(x,y):
    ans1=math.gcd(x,y)
    ans=((x*y)/(ans1))
    if ans==nn:
        return(True)
    else:
        return(False)
        
nn=int(input())

mm=int(math.sqrt(nn))

mxn=10000000000000000000000000000000000
 
for i in range(1,mm+1):
    if nn%i==0:
        if check1(i,nn//i)==True:
        
            mxx=max(i,nn//i)
            
            mxn=min(mxn,mxx)
            
            ans1,ans2=i,nn//i
            
print(ans1,ans2)