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

def mcd(p,q):
    if p%q==0:
        return q
    return mcd(q, p%q)

def mcm(a,b):
    return a // mcd(a, b) * b

a=int(sys.stdin.readline())
if a == 1:
    print(1,1)
else:
    ans=0
    i=1
    while i*i<=a:
        if a % i==0 and mcm(i, a//i)==a:
                ans=i
        i+=1
    print(ans, a//ans)
