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:
def factorise(n):
    dic={} 
    while n%2==0:
        if 2 in dic:
            dic[2]+=1
        else:
            dic[2]=1
        n=n/2
        
    for i in range(3,int(n**0.5)+1):
        while n%i==0:
            if i in dic:
                dic[i]+=1
            else:
                dic[i]=1
            n=n/i
    if n>2:
        dic[n]=1
    return dic
x = int(input())
dic = factorise(x)
factors = list(dic.keys())
arr = [i**(dic[i]) for i in factors]
arr.sort()
l=len(factors)
if x==1:
    print(1,1)
elif factors[0]!=x:
    all_sub=[]
    for i in range(2**l): 
        subset = [] 
        # consider each element in the set 
        for j in range(l): 
  
            # Check if jth bit in the i is set.  
            # If the bit is set, we consider  
            # jth element from set 
            if (i & (1 << j)) != 0: 
                subset.append(arr[j])
        all_sub.append(subset)
    
    m=10**13
    for i in all_sub:
        t=1
        for j in i:
            t*=j
        m=min(max(t,x/t),m)
    print(int(m),int(x/m))
            
    
else:
    print(1,factors[0])