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 make_prime_factors_distinct(n):
    prime_factors = []
    for k in range(2, int(n**0.5) + 1):
        if n % k == 0:
            prime_factors.append(k)
            while n % k == 0:
                n = n // k
    if n != 1:
        prime_factors.append(n)
    return prime_factors
  

x = int(input())
prime_li = make_prime_factors_distinct(x)
a = [0] * len(prime_li)

for i in range(len(prime_li)):
    num = 1
    while True:
        if x % (prime_li[i] ** num) != 0:
            break
        num += 1
    num -= 1
    a[i] = prime_li[i] ** num

ans = 10**18
for bit_state in range((1 << len(prime_li))):
    tmp = 1
    for i in range(len(prime_li)):
        if bit_state & (1 << i):
            tmp *= a[i]
    if ans > max(tmp, x // tmp):
        ans = max(tmp, x // tmp)
        res = (tmp, x // tmp)
print(*res)