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 *
def fact(n):
    l = []
    x = 1
    while(x*x<=n):
        if(n%x == 0):
            l.append(x)
        if(n//x!=x and n%(n//x) == 0):
            l.append(n//x)
        x+=1
    l.sort()
    return l
n = int(input())
if(n==1):
    print(1,1)
    exit()
l = fact(n)
maxi = 10**14
i = 0
j = len(l)-1
ans = []
while(i<j):
    if(max(l[i],l[j]) < maxi and gcd(l[i],l[j]) == 1):
        ans = [l[i],l[j]]
        maxi = max(l[i],l[j])
    i+=1
    j -= 1
print(*ans)