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
import math



def get_primes(X):
    primes = []
    num = 2
    while num*num <= X:
        num_pow = 0
        while X % num == 0:
            X //= num
            num_pow += 1
        if num_pow:
            primes.append((num, num_pow))
        num += 1
    if X:
        primes.append((X, 1))
    return primes


pair = (math.inf, math.inf)
X = int(input())
primes = get_primes(X)

def backtrack(idx, num1, num2):
    global pair
    if idx >= len(primes):
        if ((num1 * num2) // math.gcd(num1, num2)) == X and max(num1, num2) < max(*pair):
            pair = (num1, num2)
        return
    prime, prime_cnt = primes[idx] 
    for cnt in range(prime_cnt+1):
        backtrack(idx+1, num1*(prime**cnt), num2*(prime**(prime_cnt-cnt)))

backtrack(0, 1, 1)
print('{} {}'.format(*pair))
