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
x = int(input())
pri = []
i = 2
xx = x
while xx > 1 and i**2 <= x:
	if xx%i == 0:
		xx //= i
		pri.append(i)
	else:
		i += 1
if xx > 1:
	pri.append(xx)
d = {}
for i in pri:
	d[i] = 0
for i in pri:
	d[i] += 1
best = 1
nn = []
for i in d:
	nn.append(i**d[i])
for i in range(2**len(d)):
	kan = 1
	dupa = []
	for j in range(len(nn)):
		dupa.append(i%2)
		if i%2 == 1:
			kan *= nn[j]
		i //= 2
	if kan**2 <= x and kan > best:
		best = kan
print(best, x//best)