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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
public class codeforces {

    public static long gcd(long x,long y){
        if(y==0)
        return x;
        return gcd(y,x%y);
    }
    public static void main(String[] args) throws IOException {
        InputStreamReader isr = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(isr);
        // StringBuilder str=new StringBuilder();
        PrintWriter out = new PrintWriter(System.out);
        long num=Long.parseLong(br.readLine());
        ArrayList<Long> arrayList=new ArrayList<>();
        for(int i=1;i<=(int) Math.sqrt(num);i++){
            if(num%i==0){
                arrayList.add((long) i);
                arrayList.add(num/i);
            }
        }
        Collections.sort(arrayList);
        int size=arrayList.size();
        long min=Long.MAX_VALUE,extra=0;
        int s=0,e=size-1;
        while(s<e){
            long a=arrayList.get(s),b=arrayList.get(e);
            b=gcd(a,b)*b;
            if(b<min){
                min=b;
                extra=a;
            }            
            s++;
            e--;
        }      
        out.println(extra+" "+min);
        out.close();
    }
}