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:
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;


    import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
    
   public class simple3 {
    	    static long gcd(long a, long b) 
                { 
                  if (b == 0) 
                    return a; 
                  return gcd(b, a % b);  
                } 
    	public static void main(String[] args) {
    		Scanner in = new Scanner(System.in);
    		long n = in.nextLong();
    		long a = 0;
    		long b = 0;
    		long a1 = 0;
    		long b1 = 0;
    		long min = Long.MAX_VALUE;
    		
    		for(int i=1; i<=Math.sqrt(n);i++)
    		{
    		    if(n%i==0)
    		    {
    		       a = i;
    		       b = n/i;
    		       long max = Math.max(a,b);
    		       long x = gcd(a,b);
    		       if(a*b==x*n && max < min)
    		       {
    		            a1 = a;
    		            b1 = b;
    		       }
    		    }
    		}
    		System.out.println(a1 + " " + b1);
    }
}