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