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 gcd(a,b):
	if a<b:
		a, b = b,a
	r = a%b
	if r==0:
		return b
	else:
		return gcd(b, r)

n = int(input())
a,b,m = 1,n,n

for i in range(1,n):
	if i*i>=n:
		break
	if n%i==0:
		x = i
		y = n//i
		k = max([x,y])
		if gcd(x,y)==1 and k <= m:
			a,b,m  = x,y,k

print("{} {}".format(a,b))