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
# cook your dish here

import math

def gcd(x, y): 
  
   while(y): 
       x, y = y, x % y 
  
   return x 

def main():
    n = int(input())
    ans = 10000000000000;
    nq = int(math.sqrt( n ))
    nq = nq+1
    for i in range(2,nq+1):
        if n%i == 0:
            a = i
            b = n/i
            temp = gcd(a,b)
            if temp==1:
                m = max(a,b)
                ans = min(ans,m)
    if ans == 10000000000000:
        print(str(n)+" 1")
    else:
        print(str(int(ans))+" "+str(int(n/ans)))

if __name__=="__main__":
    main()