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 sys
input = sys.stdin.readline
import fractions


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors



def main():
    N = int(input())

    x = make_divisors(N)
    mi = [float("inf"), float("inf")]
    if len(x) == 1:
        print(1, 1)
        exit()
    if len(x) & 1:
        if (x[-1] * x[-1]) // fractions.gcd(x[-1], x[-1]) == N:
            mi = [x[-1], x[-1]]
    for i in range(0, len(x) - 1, 2):
        if (x[i] * x[i + 1]) // fractions.gcd(x[i], x[i + 1]) != N:
            continue
        if max(mi) > max(x[i], x[i + 1]):
            mi = [x[i], x[i + 1]]

    print(*mi)






if __name__ == '__main__':
    main()


