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
import math
from itertools import combinations
n = int(input())
a = 1
b = n
maxi = n
temp = n
l = []
count = 1
while(n%2==0):
    n=n//2
    count *=2
if(count!=1):
    l.append(count)
for j in range(3,int(math.sqrt(n))+1,2):
    count = 1
    while(n%j==0):
        n=n//j
        count = count * j
    if(count!=1):
        l.append(count)
if(n>2):
    l.append(n)

for i in range(1,len(l)):
    x = combinations(l,i)
    for k in x:
        val = 1
        for j in k:
            val *=j
        if(max(val,temp//val)<maxi):
            maxi = max(val,temp//val)
            a = val
            b = temp//val
print(a,b)
    
