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 math import sqrt,ceil
n=int(input())
a=[]
b=[]
c=0
def commfact(a,b):
    for i in range(2,ceil(sqrt(min(a,b)))+1):
        if(a%i==0 and b%i==0):
            return(0)
    return(1)    
for i in range(2,ceil(sqrt(n))+1):
    if(n%i==0):
        c=c+1
        b=[i,int(n/i)]
        a.append(b)
for i in range(len(a)-1,-1,-1):
    if(a[i][1]%a[i][0]!=0 and a[i][0]%a[i][1]!=0 and commfact(a[i][1],a[i][0])):
        print(a[i][0],a[i][1])
        c=-1
        break
if(c!=-1):
    print(1,n)
