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
t = int(input())
contador = 0
avance = int(t**0.5)
chico = 1
grande = t
mini = []

def mcd(a, b):
       while b:
           a, b = b, a%b
       return a

def mcm(a,b):
    return int(a*b/mcd(a,b))

while (avance > 1) and (contador == 0) :              #### considerá que si lo hacias a lo bruto sin la raiz, l orden se te va a la mierda, y se pasa del segundo
    if t%avance == 0:
        chico = avance
        grande = int(t/chico)
        if mcd(chico,grande) == 1:
            contador += 1
        elif len(mini) == 0:
            mini.append(chico)
            mini.append(grande)
        else:
            for i in mini:
                if mcm(i,grande) == t:
                    chico = i
                    contador += 1
                    break
    avance -= 1        
    
if contador == 0:
    print(1,t)
else:
    print(chico,grande)
