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 bisect import bisect_left


def gcd(a, b):
    while(b):
        a %= b
        a, b = b, a  # Swap para tener el mas chico en b
    return a


def divisors(n):
    d = []
    for i in range(1, int(n**0.5)+1):
        if (n % i == 0):
            d.append(i) if(i*i == n) else d.extend([i, n//i])
    return list(sorted(d))


def solve():
    n = int(input())
    if n == 1:
        print(1, 1)
        return
    for i in divisors(n):
        if i*i <= n or gcd(i, n//i) > 1:
            continue
        else:
            print(n//i, i)
            return


solve()
