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 collections import defaultdict
from itertools import combinations

def prime_factor(num):
    c = defaultdict(int)
    while not num%2:
        c[2]+=1
        num//=2
    for i in range(3,int(num**(0.5))+1,2):
        while not num%i:
            c[i]+=1
            num//=i
    if num>2:
        c[num]+=1
    l = [1]
    for i,j in c.items():
        l.append(pow(i,j))
    return l

def multi(lis):
    curr = 1
    for i in lis:
        curr*=i
    return curr

x = int(input())
l = prime_factor(x)
minim = (1,x)
for i in range(1,(len(l))//2+1):
    for lis in combinations(l,i):
        v = multi(lis)
        w = x//v
        if max(minim)>max(v,w):
            minim = (v,w)
print(*minim)
