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 *


def relative(a, b):
    if a == b and a != 1:
        return False
    elif a == b:
        return True
    for num in range(2, int(sqrt(max(a, b))) + 1):
        if a % num == 0 and b % num == 0:
            return False
    return True


inp = int(input())
middle = int(sqrt(inp))
counter = middle
break1 = False
while counter > 0 and not break1:
    if inp % counter == 0:
        temp = inp / counter
        if relative(counter, temp):
            print(int(counter), int(temp))
            break1 = True
            break
    counter = counter - 1

