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:
def binarySearch(arr,x):
	l=0
	r=len(arr)-1 
	while l <= r: 
		mid = (l + r)//2; 
		if arr[mid] == x: 
			return mid 
		elif arr[mid] < x: 
			l = mid + 1
		else: 
			r = mid - 1
	return -1

x=int(input())
f=[]
for i in range(1,int(x**0.5)+1):
	if(x%i==0):
		if(x%(x//i)==0):
			f.append(x//i)
		f.append(i)
from math import *
ans=[]
for i in range(len(f)):
	t=x//f[i]
	if(gcd(f[i],t)==1):
		if(f[i]>t):
			ans.append([t,f[i]])
		else:
			ans.append([f[i],t])
index=0
# print(ans)
c=ans[0][1]
for i in range(len(ans)):
	if(ans[i][1]<c):
		index=i
		c=ans[i][1]
print(*ans[index])