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 main():
    n = x = int(raw_input())
    p = []
    for i in xrange(2, 10 ** 6):
        if x % i == 0:
            t = 1
            while x % i == 0:
                x /= i
                t *= i
            p.append(t)
    a = 1
    b = n
    for i in xrange(1 << len(p)):
        r = 1
        for j, x in enumerate(p):
            if i >> j & 1:
                r *= x
        m = n / r
        if r > m:
            r, m = m, r
        if b > m:
            a, b = r, m
    print a, b
main()
