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 primfacs(n):
    i = 2
    primfac = []
    while i * i <= n:
        tmp = 1
        while n % i == 0:
            tmp *= i
            n = n // i
        primfac.append(tmp)
        i = i + 1
    if n > 1:
        primfac.append(n)
    primfac.sort(reverse=True)
    return primfac
   
X = int(input())
ps = primfacs(X)

products = set([1])
for p in ps:
    new_set = []
    for product in products:
        new_set.append(product*p)
    products.update(new_set)

a = 1
b = X
min_max = X
for p in products:
    new_b = X//p
    new_max = max(p, new_b)
    # print(p, new_max)
    if new_max < min_max:
        a = p
        b = new_b
        min_max = new_max

# print(products)
print(a, b)
