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 ceil,sqrt,gcd
def ii():return int(input())
def mi():return map(int,input().split())
def li():return list(mi())
def si():return input()
def lcm(x,y):
    #print(x*y//gcd(x,y))
    s=x*y
    return s//gcd(x,y)
n=ii()
if(n==1):
    print(1,1)
else:
    b=[]
    y=1
    x=int(sqrt(n))+1
    for i in range(1,x):
        if(n%i==0):
            if(i!=n//i):
                b.append(i)
        if(i==n):
            b.append(i)
    for i in range(len(b)-1,-1,-1):
        j=b[i]
        if(lcm(j,n//j)==n):
            print(j,n//j)
            break