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
n=int(input())
if n==1:
    print (1,end=" ")
    print (1)
else:
    arr=[]
    now=n
    for  j in range(2,int(pow(n,0.5))+1):
        if  n%j==0:
            k=1
            while n%j==0:
                n=n//j
                k*=j
            arr.append(k)
    if n!=1:
        arr.append(n)
    ans=9999999999999999
    ans_1=-1
    ans_2=-1
    if len(arr)==1:
        print (1,end=" ")
        print (now)
    else:
        a=1<<len(arr)-1
        while a>0:
            p=1
            q=1
            k=a
            l=len(arr)-1
            while k>=0:
                if k&1:
                    p*=arr[l]
                    l-=1
                else:
                    q*=arr[l]
                    l-=1
                if l==-1:
                    break
                k=k>>1
            z=max(p,q)
            if ans>z:
                ans=z
                ans_1=p
                ans_2=q
            a-=1
        print (ans_1,end=" ")
        print (ans_2)