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
primes=[]
primeFactors=[]
factors=[]

def gcd(a, b):
    while (b!=0):
        c=b
        b=a%b
        a=c
    return a

def sieve():
    global primes
    bs=[1]*1000010
    bs[0]=bs[1]=0;
    for i in range(2, 1000001):
        if bs[i]==1:
            for j in range(i*i, 1000001, i):
                bs[j]=0
            primes.append(i)

def p_factorize(N):
    global primes
    global primeFactors
    for p in primes:
        Count=0
        while N%p==0:
            N//=p
            Count+=1
        if Count:
            primeFactors.append((p, Count))
    if N!=1:
        primeFactors.append((N, 1))

def factorize(res, index):
    global primeFactors
    global factors
    prod=1
    if index==len(primeFactors):
        factors.append(res)
        return
    x,y=primeFactors[index]
    for i in range(y+1):
        factorize(res*prod, index+1)
        prod*=x
        
x=int(input())
minim=x
ans1=1
ans2=x
sieve()
p_factorize(x)
factorize(1, 0)
for f in factors:
    if minim>max(f, x//f) and gcd(f, x//f)==1:
        minim=max(f, x//f)
        ans1=f
        ans2=x//f
print (f'{ans1} {ans2}')