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 sys
import math
def get(l,check,a,b,i,n):
    if i==n:
        check.append([a,b])
    else:
        get(l,check,a*l[i],b,i+1,n)
        get(l,check,a,b*l[i],i+1,n)
def get_primes(n):
    l=[]
    a=1
    while n%2==0:
        n=n//2
        a=a*2
    if a!=1:
        l.append(a)
    for i in range(3,int(math.sqrt(n))+2):
        a=1
        while n%i==0:
            n=n//i
            a=a*i
        if a!=1:
            l.append(a)
    if n>2:
        l.append(n)
    return l
n=int(sys.stdin.readline())
l=get_primes(n)
l.sort()
a,b=1,1
i=len(l)-1
while i>=0:
    if a>b:
        b=b*l[i]
        i-=1
    else:
        a=a*l[i]
        i-=1
#print(a,b)
#print(l)
check=[]
get(l,check,1,1,0,len(l))
a,b=check[0]
for i in range(1,len(check)):
    if abs(check[i][1]-check[i][0])<abs(a-b):
        a,b=check[i]
print(a,b)
