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
from itertools import combinations as cb
X = int(input())

if X == 1:
    print(1, 1)
    exit()

ans = {}

k = X
while True:
    if k == 1: break
    q = k

    for i in range(2, int(math.sqrt(k))+2):
        if k % i == 0:
            if i in ans:
                ans[i] *= i
            else: ans[i] = i
            k //= i
            break
    if k == q:
        if k in ans:
            ans[k] *= k
        else:
            ans[k] = k
        break

Q = list(ans.values())
R = []
for i in range(1, len(Q)+1):
    for W in cb(Q, i):
        tmp = 1
        for w in W:
            tmp *= w
        R.append((max(tmp, X//tmp), min(tmp, X//tmp)))

R.sort()
print(R[0][1], R[0][0])