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
import math
n = int(input())

def lcm(array , n):
    first , second = array[0] , array[1]
    lcms = (first*second)//math.gcd(first , second)
    if lcms == n: return 1
    else: return 0
    

minimum = 999999999999

answer = []
for i in range(1, int(n**0.5 + 1)):
    if n%i==0:
        if i**2 != n:        # This case needed for perfect squares example 16, 64 etc.
            maxs = max( i , n//i )
            curr = [i , n//i]
            if lcm( curr , n ) == 1:
                if maxs < minimum:  
                    minimum = maxs
                    answer = [i,n//i]
            
        
        else:
            maxs = max(i,i)
            curr = [i , i]
            if lcm( curr , n ) == 1:
                if maxs < minimum:  minimum = maxs
                answer = [i,i]  
for ele in answer:
    print(ele,end=' ')
    
