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
n=int(input())
s=int(math.sqrt(n))
l=[]
for i in range(1,s+1):
    l2=[]
    if(n%i==0):
        l2.append(i)
        l2.append(n//i)
        l.append(l2)
l3=[]
#print(l)
for i in l:
    if(i[1]%i[0]!=0):
        l3.append(i)
if(len(l3)==0):
    print(1,n)
else:
    l3.sort(key = lambda x: x[1])
    #print(l3)
    for i in l3:
        #print(i)
        if int((i[0]*i[1])//math.gcd(i[0],i[1]))==n:
            print(*i)
            break