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
from collections import Counter
input = sys.stdin.readline

def prime_factor(n):
    factors = []
    f = 2
    while n%2==0:
        factors.append(f)
        n//=f
    f = 3
    while f*f<=n:
        if n%f==0:
            factors.append(f)
            n//=f
        else:
            f+=2
    if n!=1:
        factors.append(n)
    return factors


n=int(input())
factor = prime_factor(n)
L=Counter(factor)
nf = []
for i in L:
    nf.append(pow(i,L[i]))

poss = [1]
for fact in nf:
    for v in poss[:]:
        if fact*v*fact*v<=n:
            poss.append(fact*v)
best = max(poss)
print(best,n//best)

