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
x = int(input())

if x == 1:
    print (1, 1)
    exit (0)

div = 2
factors = []
while x > 1 and div ** 2 <= x:
    p = 1
    #print (x, div)
    while x % div == 0:
        x //= div
        p *= div
    if p != 1:
        factors.append(p)
    div += 1
if x > 1:
    factors.append(x)

min_min = float('inf')
for i in range(1 << len(factors)):
    a = b = 1
    for j in range(len(factors)):
        if (i >> j) & 1:
            a *= factors[j]
        else:
            b *= factors[j]
    if max(a, b) < min_min:
        min_min = max(a, b)
        r_a, r_b = a, b

print (r_a, r_b)
