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
MX = 1000000
prime = [2] 


def sieve():
    mark = [True for i in range(MX)]
    for i in range(3,MX,2):
        if (mark[i]):
            prime.append(i)
        if (i < 1000):
            for j in range(i*i,MX,i):
                mark[j] = False


sieve()
x = int(input())

temp = x
fact = []
for i in range(len(prime)):
    if (temp % prime[i] == 0):
        mul = 1
        while (temp % prime[i] == 0):
            temp //= prime[i]
            mul *= prime[i]
        fact.append(mul)
if (temp > 1):
    fact.append(temp)

mx = x
mx_a = 1
mx_b = x
lim = 1 << len(fact)
for mask in range(lim):
    a = 1
    for i in range(len(fact)):
        if (mask & (1 << i)):
            a *= fact[i]
    b = x//a
    if(max(a,b) < mx):
        mx = max(a,b)
        mx_a = a
        mx_b = b

print("{} {}".format(mx_a,mx_b))
