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


def factor(n):
    """ returns factors grouped by prime """
    factors = []

    prod = 1
    while n % 2 == 0:
        n /= 2
        prod *= 2
    if prod != 1:
        factors.append(prod)

    p = 1
    while n > 1 and p * p <= n:
        p += 2
        if n % p != 0:
            continue
        
        count = 0
        while n % p == 0:
            n /= p
            count += 1
        factors.append(p ** count)

    if n != 1:
        factors.append(n)
    return factors

def subsets(l):
    for size in xrange(len(l) + 1):
        for subset in itertools.combinations(l, size):
            yield subset

X = input()
factors = factor(X)

best = X
# iterate through all subsets of products
for lfactors in subsets(factors):
    # take product
    prod = reduce(lambda acc, f: acc * f, lfactors, 1)

    # see if it is closer to sqrt(X) than previous attempts
    best = min(max(prod, X / prod), best)

# print pair
print ' '.join(map(str, sorted([best, X / best])))