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

n=int(input())
 
i=n**0.5
if i%1==0:
    i-=1
else:
    i=i//1
 
if n%2==0:
    k=1
 
else:
    k=2
    if i%2==0:
        i-=1
 
if n<=3:
    i=1
 
else:
    while i>0:
        if n%i==0:
            if math.gcd(int(i),int(n/i))!=1:
                i-=k
                continue
            break
        i-=k

print(int(i),int(n/i))