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
def main():
    import sys
    from collections import defaultdict
    input = sys.stdin.readline

    X = int(input())
    X_raw = X

    if X == 1:
        print(1, 1)
        exit()

    x = int(X ** 0.5)
    if x**2 > X:
        x -= 1
    if (x+1)**2 <= X:
        x += 1
    prime = defaultdict(int)
    for d in range(2, x+1):
        while X % d == 0:
            prime[d] += 1
            X //= d
    if X != 1:
        prime[X] += 1

    if len(prime) == 1:
        print(1, X_raw)
        exit()

    ans = []
    for d in prime.keys():
        ans.append(d ** prime[d])
    M = len(ans)
    dp = [[0] * (x+1) for _ in range(M+1)]
    dp[0][1] = 1
    for i in range(M):
        for j in range(x+1):
            if dp[i][j]:
                if j * ans[i] <= x:
                    dp[i+1][j*ans[i]] = 1
                dp[i+1][j] = 1
    for a in range(x, -1, -1):
        if dp[-1][a]:
            print(a, X_raw//a)
            break


if __name__ == '__main__':
    main()
