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.*;
import java.io.*;
//import java.lang.*;

public class Task{
public static long gcd(long a,long b){
	if(b==0){return a;}
	return gcd(b,a%b);
}

public static void main(String[] args) throws IOException{
       Scanner s=new Scanner(System.in);
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       StringBuilder sb=new StringBuilder();
       long n=s.nextLong();
       int k=(int)Math.sqrt(n)+1;int c=0;
      	long x=1,y=n;
       for(int i=1;i<=k;i++){
       	if(n%(long)i==0){
       		if(gcd((long)i,n/i)==1&&Math.max(x,y)>Math.max((long)i,n/i)){
       			x=i;y=n/i;
       		}
       	}
       }
      
       	   	out.write(x+" "+y+" ");
       	     out.flush();   
       }
       }