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
# HEY STALKER
import math
ans = []


def printDivisors(n):
    i = 1
    while i <= math.sqrt(n):

        if n % i == 0:
            if n / i == i:
                ans.append(i)
            else:
                ans.append(i)
                ans.append(n // i)
        i = i + 1


q = int(input())
printDivisors(q)
ans.sort()
a = 2e18
b = 2e18
# print(*ans)
for t in ans:
    if math.gcd(t, q // t) == 1:
        if max(t, q // t) < max(a, b):
            a = t
            b = q // t
print(a, b)