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
num = input()
num=int(num)
a=1
b=num
m=99999999999999999
r=math.sqrt(num)
r=r+1
r=int(r)
for i in range(1, r):
	if(num%i == 0 and ((int((num/i))*i)/math.gcd(int(num/i),i))==num):
		if(max(int(num/i),i)<m):
			m=max(int(num/i),i)
			a=i
			b=int(num/i)
print("{a} {b}".format(a=a,b=b))