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
from itertools import combinations
from functools import reduce
 
def getPrimeFactors(a):
   factors = []
   for i in range(2, int((a**.5))+2):
      val = 1
      while a%i == 0:
         a//=i
         val*=i
      if val != 1: factors.append(val)
   return factors
 
a = int(input())
factors = getPrimeFactors(a)

factors.append(1)

 
m = (float("inf"), float("inf"))

for x in range(1, 7):
   comb = combinations(factors, x)
   for i in comb:
      ans = reduce((lambda x,y:x*y), i)
      b = a//ans
      m = min(m, (max(ans, b), min(ans, b)))
      
print(str(m[1]) + " " + str(m[0]))
 
