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 prime_factorize(n):
	factors = []
	orig_n = n
	d = 2
	while d*d <= orig_n and n > 1:
		if n%d==0:
			pk = 1
			while n%d==0:
				n //= d
				pk *= d
			factors.append(pk)
		d += 1
	if n > 1:
		factors.append(n)
	return factors
factors = prime_factorize(int(input()))
ansA, ansB = 10**18, 10**18 #INF
for mask in range(1<<len(factors)):
	a, b = 1, 1
	for i in range(len(factors)):
		if mask&(1<<i):
			a *= factors[i]
		else:
			b *= factors[i]
	if max(a,b) < max(ansA,ansB):
		ansA, ansB = a, b
print(ansA,ansB) 
