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 Main
{
    public static long gcd(long a,long b)
    {
        return b==0?a:gcd(b,a%b);
    }
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int t=1;
		while(t-->0)
		{
		    long n=sc.nextLong();
		    long ans=n;
		    long a=1,b=n;
		    for(long i=Long.valueOf(2);i*i<=n;i++)
		    {
		        if(n%i==0)
		        {
		            long x=n/i;
		            long y=i;
		            long g=gcd(x,y);
		            if(g==1)
		            {
		                if(x<ans)
		                {
		                    ans=x;
		                    a=i;b=x;
		                }
		            }
		        }
		    }
		    System.out.println(a+" "+b);
		}
		
	}
}