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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;

public class problem3 {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        long X = Long.parseLong(reader.readLine());
        long max = -1;
        long min = -1;
        for(long i = 2; i <= Math.sqrt(X);i++){
            if(X % i == 0){
                BigInteger a = BigInteger.valueOf(i);
                BigInteger b = BigInteger.valueOf(X).divide(a);
                if(a.gcd(b).equals(BigInteger.ONE)) {
                    long max_ = a.max(b).longValue();
                    if(max == -1){
                        max = max_;
                        min = a.min(b).longValue();
                    }else{
                        if (max_ < max) {
                            max = max_;
                            min = a.min(b).longValue();
                        }
                    }
                    
                }
            }
        }
        if(max == -1){
            System.out.println(1+" "+X);
        }else{
            System.out.println(min+" "+max);
        }

    }
}
