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
x=int(input())
v=[]
k = math.ceil(math.sqrt(x))
for i in range(1,k+1):
    if(x%i == 0):
        v.append(i)
ans=9999999999999
flag=0
for i in range(len(v)):
    lcm=(v[i]*(x//v[i]))//math.gcd(v[i],x//v[i])
    if(lcm == x):
        res=max(v[i],x//v[i])
        if(res < ans):
            flag=1
            ans=res
            p1=v[i]
            p2=(x//v[i])
if(flag):
    print(p1,p2)
else:
    print(1,x)