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 gcd(a,b): 
	if a == 0: 
		return b 
	return gcd(b % a, a)  
def lcm(a,b):
    return a*b//gcd(a,b)
n=int(input())
fact=[]
for i in range(1,int(n**0.5)+2):
    if(n%i==0):
        if(i**2==n):
            fact.append(i)
        else:
            fact.append(i)
            fact.append(n//i)
fact.sort() 
if n==1:
    print("1 1")
elif len(fact)%2==0:
    i=len(fact)//2-1
    j=len(fact)//2
    while(True):
        if lcm(fact[i],fact[j])==n:
            print(fact[i],fact[j])
            break
        else:
            i-=1
            j+=1
else:
    i=len(fact)//2-1
    j=len(fact)//2+1
    while(True):
        if lcm(fact[i],fact[j])==n:
            print(fact[i],fact[j])
            break
        else:
            i-=1
            j+=1