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
"""x=int(input())
L=[]
import math
for i in range(1,x+1):
    for j in range(i,x+1):
        t=(i*j)//math.gcd(i,j)
        #print(i,j,t)
        L.append((t,i,j))

print(sorted(L))
"""

import math

n=int(input())

ans=n
i=1
c1=1
c2=n
while(i<=math.sqrt(n)):
    if(n%i==0):
        if(n//i==i):
            t=(i*i)//math.gcd(i,i)
            if(i<ans and t==n):
                ans=min(i,ans)
                c1=i
                c2=i
        else:
            t=(i*(n//i))//math.gcd(i,(n//i))
            if(max(i,n//i)<ans and t==n):
                c1=i
                c2=n//i
                ans=min(ans,max(i,n//i))

    i+=1

print(c1,c2)
          
