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 com.sun.scenario.effect.impl.sw.sse.SSEBlend_SRC_OUTPeer;

import java.util.Scanner;

public class FadiLCM {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        long num = scanner.nextLong();
        maxLCM(num);
//        System.out.println(getGCD(6,7));
    }

    public static void maxLCM(long number){
        int sqrRoot = (int) Math.sqrt(number);
        for (long i = sqrRoot; i >= 1 ; i--) {

            if(number % i == 0){
                long pair = number / i;
                if(getGCD(pair, i) == 1){
                    System.out.println(i + " " + pair);
                    return;
                }
            }
        }
    }

    private static long getGCD(long pair, long number){
        return (number == 0) ? pair: getGCD(number, pair % number);
    }

}