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.ArrayList;
import java.util.Scanner;

public class FadiandLCM {


    public static void main(String[] args) {

        Scanner s = new Scanner(System.in);
        long a = s.nextLong();
        maxLCMPair((long)a);
    }

    public static void maxLCMPair(long n){
        // Get the factors from its sqroot backwards
        long sqrRoot = (long) Math.sqrt(n);
        ArrayList<Long> factors = new ArrayList<>();
        for (int i = 1; i <= sqrRoot; i++) {
            if(n % i == 0) factors.add((long)i);
        }

        //Get each factor's pair and check its GCD
        for (int i = factors.size()-1; i >= 0; i--) {
            long factor = factors.get(i);
            long pair = n / factor;
            if(getGCD(pair, factor) == 1){
                System.out.println(factor + " " + pair);
                return;
            }
        }
    }

    public static long getGCD(long a, long b){
        return (b == 0) ? a :getGCD(b,a % b);
    }
}