Problem: 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

Solution (in PYTHON3):

Solution:
import itertools

def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

n = int(input())

fs = []
last_f = 1
for f in prime_factors(n):
    if f == last_f:
        fs[-1] *= f
    else:
        fs.append(f)
        last_f = f

def findsubsets(S,m):
    return set(itertools.combinations(S, m))

def allsubsets(S):
    out = set([])
    for i in range(1, len(S)+1):
        out = out | findsubsets(S, i)
    return out

alls = allsubsets(fs)

sol = [1, 1]
sol_m = 10**13
for ss in alls:
    p1 = 1
    for si in ss:
        p1 *= si
    p2 = n // p1
    if max(p1, p2) < sol_m:
        sol = [p1, p2]
        sol_m = max(p1, p2)

print(sol[0], sol[1])