Problem: 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

Solution (in PYTHON3):

Solution:
import math


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


m = 1e12
x = int(input())
target = int(math.sqrt(x)) + 1
for i in range(1, target):
    if x%i != 0:
        continue
    d1 = x // i
    a1 = gcd(i, d1)
    if a1 == 1 or a1 == x:
        if min(i, d1) < m:
            m = max(i, d1)
            ans = [i, d1]
print(*ans)