Problem: 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

Solution (in PYTHON3):

Solution:


"""
NTC here
"""
import sys
input= sys.stdin.readline
flush= sys.stdout.flush
# import threading
# sys.setrecursionlimit(10**6)
# threading.stack_size(2**26)

def iin(): return int(input())
def lin(): return list(map(int, input().split()))

def factors(a):
    fact = []
    if a % 2 == 0:
        ch = 0
        while a % 2 == 0:
            ch += 1
            a //= 2
        fact.append(pow(2, ch))
    i = 3
    while i*i <= a:
        if a % i == 0:
            ch = 0
            while a % i == 0:
                ch += 1
                a //= i
            fact.append(pow(i, ch))
        i += 2
    if a > 1:
        fact.append(pow(a, 1))
    return fact
    
def main():
    from math import gcd
    gcd = gcd
    x = iin()
    a, b= 1, x
    i = 1
    while i*i<=x:
        if x%i ==0:
            m,n = i, x//i
            ch1 = gcd(m,n)
            if ch1 ==1:
                if max(a, b)>max(m, n):
                    a, b= m, n
        i+=1
    print(a, b)


main()

#threading.Thread(target=main).start()