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
# -*- coding: utf-8 -*-

x = int(input())
                        
if x == 1:
    print(1, 1)
else:
    r = x**(1/2)
    r0 = int(r)
    if r0*r0 == x:
        r0 -= 1
    
    fl = True
    
    def check(x1,x2):
        mmin = min(x1,x2)
        res = True
        
        if mmin != 1:
            f = True
            while f:
                if x1 % mmin == 0 and x2 % mmin == 0:
                    f = False
                    res = False
                
                mmin -= 1
                if mmin == 1:
                    f = False
            
        return res
    
    while fl:
        if x % r0 == 0:
            a = x // r0
            b = x // a
            
            if check(a,b):
                fl = False
                
            else:
                r0 -= 1
            
        else:
            r0 -= 1
            
        if r0 == 0:
            fl = False
            a = 1
            b = x
            
            
    print(a, b)