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 sys
import math as mt 
input=sys.stdin.buffer.readline
#t=int(input())
t=1
for ___ in range(t):
    x=int(input())
    x1=x
    i=2
    pf=[]
    #pf.append(1)
    while i*i<=x:
        if x%i==0:
            curr=1
            while x%i==0:
                curr*=i    
                x//=i
            pf.append(curr)
        i+=1
    if x1>1:
        pf.append(x)
    #print(pf)    
    n=len(pf)
    a,b=10**18+1,10**18+1
    
    for i in range(1<<n):
        a1,b1=1,1
        for j in range(n):
            if ((i>>j) & 1):
                a1*=pf[j]
            else:
                b1*=pf[j]
        if max(a,b)>max(a1,b1):
            a=a1
            b=b1
            
    print(a,b)