Problem: 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

Solution (in JAVA):

Solution:
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        long x = scan.nextLong();

        for (long i = (int)Math.floor(Math.sqrt(x)); i > 0; i--) {
            if(x % i != 0) {
                continue;
            }
            long ggt = getGGT(i, x/i);
            if(ggt == 1) {
                System.out.println(i + " " + x/i);
                return;
            }
        }
    }

    private static long getGGT(long a, long b) {
        while(a % b != 0) {
            long tmp = a % b;
            a = b;
            b = tmp;
        }

        return b;
    }

}