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 gcd(a, b):
    while b != 0:
        a %= b
        k = a
        a = b
        b = k
    return a

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

x = int(input())
pairs = []
if x == 1:
    print ("1 1")
else:
    a = 1
    while a * a < x:
        if x % a == 0:
            b = x // a
            pairs.append((a, b))
        a += 1

    min = 9999999999999999999999999999
    mp = (0, 0)
    for p in pairs:
        if lcm(p[0], p[1]) == x:
            if p[0] + p[1] < min:
                min = p[0] + p[1]
                mp = p

    print (mp[0], mp[1])