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
from collections import Counter
from functools import reduce
from itertools import combinations
from operator import mul

x = int(input())

xx = x
c = Counter()
for i in range(2,int(x**0.5)+1):
    while xx%i==0:
        c[i]+=1
        xx//=i
    if xx==1:
        break

if xx>1:
    c[xx]+=1


mn, aa,bb = x, x, 1
for i in range(1,len(c)//2+1):
    for com in combinations(c.keys(),i):
        a = reduce(mul,(j**c[j] for j in com),1)
        b = x//a
        if max(a,b)<mn:
            mn,aa,bb = max(a,b),a,b

print (aa,bb)

# print(c)
