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
def lcm(a, b):
    return a*b // math.gcd(a, b)

x = int(input())
l = []
i=1
ed = math.floor(x**(.5))
while(i<=ed):
  if(x%i==0):
    l.append([i,x//i])
  i+=1
mx =max(l[0][0],l[0][1])
l1 = [l[0][0],l[0][1]]
for i in l:
  if(lcm(i[0],i[1])==x):
    if(max(i[0],i[1])<mx):
      l1 = [i[0],i[1]]
print(*l1)
    
  

