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.text.DecimalFormat;
import java.io.*;
public class FedorNewGame {
	
	public static long hcf(long a, long b)
	{
		if (b == 0) 
	        return a; 
	    return hcf(b, a % b); 
	}

	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		long x=Long.parseLong(br.readLine());
		long a=1;
		long b=x;
		for (long i=2;i<Math.sqrt(x);i++)
		{
			if (x%i==0)
			{
				if (Math.max(i, x/i)<Math.max(a, b) && hcf(i,x/i)==1)
				{
					a=i;
					b=x/i;
				}
			}
		}
		System.out.println(a+" "+b);
	}
}