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 gcd(a, b):
    while b > 0:
        a, b = b, a % b
    return a
def Factor(n):
   Ans = []
   d = 1
   while d * d <= n:
        if n % d == 0:
           Ans.append([d, n//d])
        d += 1
   return Ans
x = int(input())
Ans = Factor(x)
min = Ans[0][1]
minI = 0
for i in range(len(Ans)):
    if Ans[i][1] < min and gcd(Ans[i][0],Ans[i][1]) == 1:
        min = Ans[i][1]
        minI = i
print(str(Ans[minI][0]) + " " + str(Ans[minI][1]));