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
import math


class Read:
    @staticmethod
    def string():
        return input()

    @staticmethod
    def int():
        return int(input())

    @staticmethod
    def list(sep=' '):
        return input().split(sep)

    @staticmethod
    def list_int(sep=' '):
        return list(map(int, input().split(sep)))

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

def solve():
    x = Read.int()
    if x < 6:
        print('1 ' + str(x))
    else:
        i = math.floor(math.sqrt(x))
        if i * i == x:
            i -= 1
        while True:
            t = x // i
            if x % i == 0 and lcm(i, t) == x:
                print('{} {}'.format(i, x//i))
                return
            i -= 1


query_count = 1
# query_count = Read.int()
while query_count:
    query_count -= 1
    solve()
