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
import math

def lcm(x, y):
	return x*y/gcd(x, y)

def gcd(x, y):
	if x == 0:
		return y
	return gcd(y%x, x)

X = int(input())
pairs = []
for i in range(1,int(math.sqrt(X))+1):
	if X%i == 0:
		a = i
		b = int(X/i)
		pairs.append((a, b))

minimum = float("Inf")
for i in pairs:
	if lcm(i[0], i[1]) == X:
		maximum = max(i[0], i[1])
		if (minimum > maximum):
			minimum = maximum
			t1 = min(i[0], i[1])
			t2 = maximum
print(t1, t2)

# minimum = float("Inf")
# for i in pairs:
# 	maximum = max(i)
# 	if (minimum > maximum):
# 		minimum = maximum
# 		tup = i
# print(tup[0], tup[1])