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
def factors(x):
    result = []
    i = 1
    while i * i < x:
        if x % i == 0:
            result.append(i)
        i += 1
    return result


def gcd(big, small):
    mod = big % small
    if mod == 0:
        return small
    return gcd(small, mod)


def find_nums(lcm):
    f = factors(lcm)
    biggest = lcm

    for i in f:
        bigger = lcm // i
        if bigger < biggest and gcd(i, bigger) == 1:
            biggest = bigger

    return str(lcm // biggest) + " " + str(biggest)


def solution(inp):
    return find_nums(inp)


def main():
    print(solution(int(input())))


if __name__ == "__main__":
    main()
