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 PYTHON):

Solution:
import math
n = input()
m =n 

ans = []
for i in range(2,int(math.sqrt(n)+1)):
	if n%i == 0:
		c = 1
		while n%i == 0:
			n/=i
			c*=i
		ans.append(c)

	if n <i:
		break

if n!= 1:
	ans.append(n)

nums = len(ans)
minv = m+1

ret = (1,m)
for i in range(2**nums):
	v1 = 1
	for j in range(nums):
		if (i>>j)&1:
			v1*=ans[j]
	v2 = m/v1
	if v1+v2<minv:
		ret = (v1,v2)
		minv = v1+v2
print ret[0],ret[1]