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
from itertools import chain, combinations
from operator import mul
from functools import reduce
import sys


def primes(n):
    primfac = [1]
    d = 2
    while d*d <= n:
        while (n % d) == 0:
            if primfac[-1] % d!=0:
                primfac.append(d)  # supposing you want multiple factors repeated
            else:
                primfac[-1]*=d
            n //= d
        d += 1
    if n > 1:
       primfac.append(n)
    return primfac

X = int(input())
ps = list(sorted(primes(X)[1:]))

ans = 10**13
amin=1
bmin=1
def rec(i,j,l):
    if l == 0:
        global ans,amin,bmin
        if max(i,j)<ans:
            ans=max(i,j)
            amin=i
            bmin=j
        return
    rec(i*ps[-l],j,l-1)
    rec(i,j*ps[-l],l-1)
rec(1,1,len(ps))
print(amin,bmin)

