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 coprime(a,b):
    ok = True
    if(b%a==0):
        ok = False
    else:
        for i in range(2, int(math.sqrt(a))+1):
            if(b%i==0):
                ok = False
                break
    return ok

def facts(n):
    ans = []
    for i in range(1, int(math.sqrt(n)+1)):
        if(n%i==0):
            ans.append(i)
            ans.append(n//i)
    ans = sorted(ans)
    return ans
x = int(input())
fs = facts(x)
pnt1, pnt2 =(len(fs)//2)-1, (len(fs)//2)
a,b = 0, 0
while(pnt1> 0):
    if(math.gcd(fs[pnt1], fs[pnt2])==1):
        a, b = fs[pnt1], fs[pnt2]
        break
    pnt1-=1
    pnt2+=1
if(a==0 and b==0):
    print(1, x)
else:
    print(a,b)