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
# cook your dish here
import math
from collections import Counter
def gcd(a,b): 
    if a == 0: 
        return b 
    return gcd(b % a, a) 
def lcm(a,b): 
    return (a*b) / gcd(a,b) 
def printDivisors(n) : 
    i = 1
    l=[]
    while i <= math.ceil(math.sqrt(n)): 
        if (n % i == 0) : 
            if (n //i == i) : 
                l.append(i) 
            else : 
                l.append(i)
                l.append(n//i)
        i = i + 1
    return l
n=int(input())
m=1000000000001
r=printDivisors(n)
#print(r)
for i in r:
    if(m>max(i,n//i) and lcm(i,n//i)==n):
        m=max(i,n//i)
        a=i
        b=n//i
e=min(a,b)
f=max(a,b)
print(e,f)

  

    

