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
def f(num1, num2, i):
    global a1, a2
    if i == len(ar):
        if max(num1, num2) < max(a1, a2):
            a1, a2 = num1, num2
        return
    kek = ar[i]
    lol = 1
    while i < len(ar) and ar[i] == kek:
        i += 1
        lol *= kek
    f(num1 * lol, num2, i)
    f(num1, num2 * lol, i)


x = int(input())
ar = []
i = 2
while i * i <= x:
    if x % i == 0:
        x //= i
        ar.append(i)
    else:
        i += 1
ar.append(x)
a1, a2 = 10 ** 12, 10 ** 12
f(1, 1, 0)
print(a1, a2)
