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 gcd(a,b):
    if a == 0:
        return b
    return gcd(b % a, a)

def lcm(a,b):
    return (a*b) / gcd(a,b)

def div(n) :
    q=[]
    i = 1
    while i <= math.sqrt(n):

        if (n % i == 0) :
            if (n / i == i) :
                q.append(i)
            else :
                q.append(i)
                q.append(n//i)
        i = i + 1
    return(q)

import math

x=int(input())
l=div(x)
l.sort()

d={}
ans=10**13
for i in range(len(l)):
    u=x//l[i]
    if l[i] in d:
        break
    else:
        d[l[i]]=1

    if lcm(l[i],u)==x:
        temp=max(l[i],u)
        ans=min(ans,temp)

print(ans,x//ans)