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 fun(n):
    l = [1]
    x = 1
    while n % 2 == 0:
        x *= 2
        n = n / 2
    if x > 1:
        l.append(x)
    sq = (math.sqrt(n))
    i = 3
    while i < sq + 1+1:
        x = 1
        if n % i == 0:
            j = n // i
            while n % i == 0:
                x *= i
                n = n / i
            if x > 1:
                l.append(x)
        i += 2
    if n > 1:
        l.append(n)
    return l


n = int(input())
ff = fun(n)
fa = 1e20
fb = 1e20


for x in range(1 << len(ff)):
    a = 1
    b = 1
    for i in range(len(ff)):
        if x & (1 << i) != 0:
            a *= ff[i]
        else:
            b *= ff[i]
    if max(fa, fb) > max(a, b):
        fa, fb = a, b
# print(ff)
print(int(fa), int(fb))
