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 isrp(a, b):
	if a==1 or b==1: 
		return True;
	while(1):         
		t = a%b;
		if t == 0:
		    break
		else:
			a = b
			b = t
		
	
	if b>1:
	    return False
	else:
	    return True	
x = int(input())
xn = int(math.sqrt(x))+1
# print(xn)
for i in range(0,xn-1):
    nn = xn-i
    if x%nn==0 and isrp(nn,int(x/nn)):
        print(nn,end=' ')
        print(int(x/nn))
        break
    if i == xn-2:
        print(1,end=' ')
        print(x)
# print(1)
# print(x)