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
def GCP(a, b):
    #print(a, b)
    if a == 0 or b == 0:
        return(max(a, b))
    elif a > b:
        return GCP(a % b, b)
    else:
        return GCP(b % a, a)
        
def LCM(a, b):
    return ( a // GCP(a, b) ) * b;

n = int(input())

#divs = []
best_div_1 = '1'
best_div_2 = str(n)
min_max_div = n
# ищем делители числа n ;)
div = 1

while div*div <= n:
   
    if n % div == 0:
        #print(max(div, n//div), min_max_div)
        if max(div, n // div) < min_max_div:
            if LCM(div, n//div) == n:
                min_max_div = max(div, n // div)
                best_div_1 = str(min(div, n//div))
                best_div_2 = str(max(div, n//div))
    div += 1
    
print(best_div_1, best_div_2)