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
import math
x = int(input())
lst = []
sq = int(math.sqrt(x))
for i in range(1, sq+1):
    if i*i == x:
        lst.append((i, i))
    else:
        if(x % i == 0):
            j = int(x/i)
            if(j % i != 0 or i == 1):
                lst.append((i, j))
mini = x + 1
n = len(lst)
for i in range(n):
    if(int(lst[i][0]*lst[i][1]/math.gcd(lst[i][0], lst[i][1])) == x):
        if lst[i][1] < mini:
            mini = lst[i][1]
            ele = lst[i][0]
            ele1 = lst[i][1]
print(ele, ele1)
