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
x=int(input())
ans1=1
ans2=x
ans3=x
lis=[]
cnt=0
for i in range(2,int(x**0.5)+2):
	while x%i==0:
		x//=i
		cnt+=1
	if cnt>0:
		lis.append([i,cnt])
		cnt=0
if x!=1:
	lis.append([x,1])
def two(i):
	q="0"*(len(lis)-len(bin(i)[2:]))+bin(i)[2:]
	return q
for i in range(2**len(lis)):
	a=b=1
	for j in range(len(lis)):
		if two(i)[j]=="1":
			a*=lis[j][0]**lis[j][1]
		else:
			b*=lis[j][0]**lis[j][1]
	if max(a,b)<ans3:
		ans1=a
		ans2=b
		ans3=max(a,b)
print(ans1,ans2)

