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 min_possible_divisors(X):
	a =1
	A=[]
	B=[]
	for i in range(2,int(X**(0.5))+1):
		if X%i == 0:
			a = i
			b = X//a
			if b%a !=0 and hcf(a,b)==1:
				A.append(a)
	if len(A)>0:
		return str(max(A)) + ' ' + str(X//max(A))	
	else:			
		return str(1)+" "+str(X)	

def hcf(a,b):
	while a>0:
		h=b%a
		b=a
		a = h
	return(b)
				

X = int(input())
print(min_possible_divisors(X))