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
from math import *
def gcd(a, b):
    c = 1
    a, b = max(a,b), min(a,b)
    while c != 0:
        c = a%b
        a,b = b,c
    return a
def find_min_of_max(lists):
    a = lists[0]
    b = lists[1]
    
def countCoprimePairs(n) :
    coprime_list = []
    maximum_list = []
    for i in range(2, int(sqrt(n)) + 1) :
        if n % i == 0 :
            if gcd(i, n // i) == 1 :
                coprime_list.append([i, n//i])
                maximum_list.append(max(i, n//i))
    if coprime_list == []:
        print("1 " + str(n))
        return
    min_index = min(enumerate(maximum_list),key=lambda x: x[1])[0]
    ans = coprime_list[min_index]
    print(str(ans[0]) + ' ' + str(ans[1]))

N = int(input())
countCoprimePairs(N)
