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.*;
public class GFG {
    public static long gcd(long a,long b)
    {
        if(a==0)
        return b;
        return gcd(b%a,a);
    }
    public static long lcm(long a,long b)
    {
        return (a*b)/gcd(a,b);
    }
	public static void main (String[] args) {
		Scanner sc=new Scanner(System.in);
		long x=sc.nextLong();
		long a=0,b=0,a1=0,b1=0;
		long min=Long.MAX_VALUE;
		for(long i=1;i<=(long)Math.sqrt(x);i++)
		{
		    if(x%i==0)
		    {
		        if(lcm(i,x/i)==x){
		        a=i;b=x/i;
		        if((long)Math.max(a,b)<min){min=(long)Math.max(a,b);a1=a;b1=b;}
		        }
		    }
		}
		System.out.println(a1+" "+b1);
	}
}