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
# def hcf(a,b):
#     if (a == b): 
#         return a 
  
#     # a is greater 
#     if (a > b): 
#         return hcf(a-b, b) 
#     return hcf(a, b-a) 

x = int(input())
a = 10**6
aa = []
bb = []
maxofab = []
while a>=1:
    if x%a == 0:
        b = x//a
        if math.gcd(a,b) == 1:
            lcm = x
            aa.append(a)
            bb.append(b)
            maxofab.append(max(a,b))
    a -=1
m = min(maxofab)
ind = maxofab.index(m)
print(aa[ind],bb[ind])