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 LMC(a, b):
    n = a * b
    while a != 0 and b != 0:
        if a > b:
            a = a % b
        else:
            b = b % a
    nod = a + b
    nok = n // nod

    return nok


from math import sqrt, ceil
n = int(input())
dividers = []
for i in range(1, ceil(sqrt(n))):
    if n % i == 0:
        dividers.append([i, n // i])
dividers_with_LMC = []
for el in dividers:
    if LMC(el[0], el[1]) == n:
        dividers_with_LMC.append(el)
if n == 1:
    print('1 1')
else:
    min_pair = dividers_with_LMC[0]
    for el in dividers_with_LMC:
        if max(el[0], el[1]) < max(min_pair[0], min_pair[1]):
            min_pair = el
    print(*min_pair)