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

# Function to find HCF the Using Euclidian algorithm
def hcf(x, y):
   while(y):
       x, y = y, x % y
   return x

X=int(input())
arr=[0]*2
if X==1 or X==2 or X==3:
	print('1 '+str(X))
else:	
	signal=False
	for i in range(int(math.sqrt(X)),1,-1):
		if X%i==0:
			arr=[i,X//i]
			if hcf(arr[0],arr[1])==1:
				print(str(arr[0]) + ' ' +str(arr[1]))
				signal=True
				break
	
		
	if signal==False:
			print('1 '+str(X))