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 gcd, inf
import itertools


def factors(n):
    return set(itertools.chain.from_iterable((i, n//i) for i in range(1, int(n**0.5)+1) if n % i == 0))


def coprime(a, b):
    return gcd(a, b) == 1


x = int(input())

if x == 1:
    print(1, 1)
else:
    f = list(factors(x))
    mx = inf
    min_pair = None
    for i in range(len(f) - 1):
        a = f[i]
        b = x // a
        
        if a != b and coprime(a, b):
            mxx = max(a, b)
            if mxx < mx:
                mx = mxx
                min_pair = (a, b)
    print(*min_pair)