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.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.Vector;

import javax.print.attribute.standard.PrinterMessageFromOperator;

public class Main
{
    public static void main(String[] args) throws IOException 
    {
    	StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));		
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		while (in.nextToken() != StreamTokenizer.TT_EOF) 
		{
	        long num = (long)in.nval;
	        for(long num1 = (long)Math.sqrt(num) ; num1 >= 1; num1--)
	        {
	        	if(num % num1 == 0)
	        	{
	        		long num3 = num1;
	        		long num4 = num / num3;
	        		for(;num3 != 0;)
	        		{
	        			long temp = num3;
	        			num3 = num4 % num3;
	        			num4 = temp;
	        		}
    				if(num4 == 1)
    				{
    					out.println(num1 + " " + num / num1);
    					out.flush();
    					break;
    				}
	        	}
	        }
		}
    }
}