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
def gcd(x, y): 
  
   while(y): 
       x, y = y, x % y 
  
   return x 

x=int(input())
f=[]
ans=(1000000000000,10000000000000000)
for i in range(1,int(x**(0.5))+1):
	if x%i==0:
		f.append(i)
		f.append(x//i)
		if gcd(i,x//i)==1:
			if max(i,x//i)<max(ans):
				ans=(i,x//i)
print (ans[0],ans[1])





# import math
# def primeFactors(n): 
# 	factors=[1]
# 	if n%2==0:
# 		factors.append(2)
# 	while n % 2 == 0:
# 		n = n // 2
# 	for i in range(3,int(math.sqrt(n))+1,2): 
# 		if n%i==0:
# 			factors.append(i)
# 		while n % i== 0: 
# 			n = n // i 
# 	if n > 2: 
# 		factors.append(n)
# 	return factors

# x=int(input())
# f=primeFactors(x)
# f.sort()
# print (f)
