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 gcd(a, b):
    while (b):
        t = a % b
        a = b
        b = t
    return a


n = int(input())
p = int(pow(n, 0.5))
res = pow(10, 13)
for i in range(1,p + 1):
    if n % i == 0:
        a1 = max(i,n//i)
        a2 = min(i,n//i)
        if gcd(a1,a2)==1 and a1<res:
            res = a1
else:
    print(res,n//res)
