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 PYTHON):

Solution:
from collections import Counter
import math
class Solution(object):

    def prime_decompose(self,n):
        ans=[]
        i=2
        while(i<=math.sqrt(n)+1):
            while(n%i==0):
                ans.append(i)
                n=n//i
            i+=1
        if n>=2:
            ans.append(n)
        
        return Counter(ans)
        
        
    def solve(self,n):
        prime_counter=self.prime_decompose(n)
        prime_factors=[key**prime_counter[key] for key in prime_counter]

        ans=n
        result_set=set([1])
        for item in prime_factors:
            temp_set=set()
            for result in result_set:
                t_result=item*result
                temp_max=max(t_result,n//t_result)
                if temp_max<ans:
                    ans=temp_max
                temp_set.add(t_result)
            result_set|=temp_set
        return ans,n//ans
            
if __name__=="__main__":
    n= int(raw_input().strip())
    T=Solution()
    a,b= T.solve(n)
    print a,b