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

n = int(input())
f = 1
ans = [1e15, 1e15]
while f * f <= n:
	if(n % f == 0 and int(math.gcd(f, int(n / f))) == 1):
		# print(f, n / f)
		if max(f, n / f) < max(ans[0], ans[1]):
			ans[0] = f
			ans[1] = n / f
	f += 1

print(int(ans[0]), int(ans[1]), sep = " ")