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 collections import defaultdict

INF = 10 ** 20

def solve(n):
    d = defaultdict(int)

    i = 2
    while i * i <= n:
        while n % i == 0:
            d[i] += 1
            n /= i
        if i == 2:
            i += 1
        else:
            i += 2
    if n != 1:
        d[n] += 1

    ns = []
    for key, value in d.items():
        ns.append(key ** value)

    n = len(ns)
    res = (INF, INF)
    for i in xrange(1 << n):
        l, r = 1, 1
        for j in xrange(n):
            if i & (1 << j):
                l *= ns[j]
            else:
                r *= ns[j]
        l, r = min(l, r), max(l, r)
        if max(l, r) < max(res):
            res = (l, r)
    return res

assert solve(2) == (1, 2)
assert solve(6) == (2, 3)
assert solve(4) == (1, 4)
assert solve(12) == (3, 4)

n = int(raw_input())
l, r = solve(n)
print l, r

