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 all_factors(n):
	from functools import reduce
	return set(reduce(list.__add__,([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0)))

def gcd(a,b):
	div=int(min(a,b))
	divid=int(max(a,b))
	while(div>0):
		temp=divid%div
		divid=div
		div=temp
	return divid

def lcm(a,b):
	return(a*b)//gcd(a,b)

x=int(input())
ls=list(all_factors(x))
ls.sort()

mini=ls[-1]
for z in range(0,len(ls)-1):
	if(lcm(ls[z],x//ls[z])==x):
		if(mini>max(ls[z],x//ls[z])):
			mini=max(ls[z],x//ls[z])


print(x//mini,end=" ")
print(mini)



	