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 sqrt
from collections import Counter

def poss(i=0, c=1):
    if i == m:
        subs.append(c)
        return

    poss(i+1, c)
    poss(i+1, c * a[i])

def facts(x):
    while x % 2 == 0:
        l.append(2)
        x //= 2

    for i in range(3, int(sqrt(x)) + 1, 2):
        while x % i == 0:
            l.append(i)
            x //= i

    if x > 1:
        l.append(x)

l = []
subs = []

x = int(input())
facts(x)

c = Counter(l)

a = sorted(i ** c[i] for i in c.keys())

l = r = 1

for i in a:
    r *= i

i = 0

cm = r

m = len(a)

poss()

l = min(subs, key=lambda y: max(y, x // y))
r = x // l

if l > r:
    l, r = r, l

print(l, r)
