Problem: 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

Solution (in PYTHON3):

Solution:
import math
t=int(input())
mini=1000000000000
ans=1
for i in range(1,int(pow(t,0.5)+1)):
	a=i
	b=t//i
	#x=a*b//math.gcd(a,b)
	if a*b==t and b%a!=0 and math.gcd(a,b)==1:
		#print(a,end=" ")
		#print(b)
		if max(a,b)<mini:
			mini=max(a,b)
			#print(mini)
			ans=a
A=[]
A.append(ans)
A.append(t//ans)
print(A[0],end=" ")
print(A[1])