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
n=int(input())
z=n
lfi=[]
i=2
while(i*i<=n):
	if(n%i==0):
		count=0
		while(n%i==0):
			n=n//i
			count+=1
		lfi.append((i,count))
	i+=1
if(n!=1):
	lfi.append((n,1))
mina=[]
con=len(lfi)
for i in range(1<<con):
	num1=1
	num2=1
	for j in range(con):
		if(i&(1<<j)):
			num1=num1*pow(lfi[j][0],lfi[j][1])
	num2=z//num1
	mina.append((max(num1,num2),num1,num2))
if(mina==[]):
	print(1,1)
else:
	t=min(mina)
	print(t[1],t[2])
