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 LCM(a,b,x):
    hcf=HCF(a,b)
    lcm=a*b//hcf
    if int(lcm)==x:
        return True
    else:
        return False

def HCF(a,b):
    x=max(a,b)
    y=min(a,b)
    if x%y==0:
        return y
    else:
        return HCF(y,x%y)

x=int(input())
factors_Array=[]
factors_Array.append(1)
factors_Array.append(x)
if x**0.5!=int(x**0.5):
    for i in range(2,int(x**0.5)+1):
        if x%i==0:
            factors_Array.append(i)
            factors_Array.append(x//i)
elif x**0.5==int(x**0.5):
    for i in range(2,int(x**0.5)):
        if x%i==0:
            factors_Array.append(i)
            factors_Array.append(x//i)
    
if x**0.5==int(x**0.5):
    factors_Array.append(int(x**0.5))

factors_Array.sort()
# print(factors_Array)
pairs=[]
n=len(factors_Array)
for i in range(len(factors_Array)//2):
    a=factors_Array[i]
    b=factors_Array[n-i-1]
    if LCM(a,b,x):
        pairs.append([a,b])

# print(pairs)
ans=max(pairs)
for i in range(2):
    print(ans[i],end=" ")



    
