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.*;
import java.math.*;
import java.text.*;
import java.util.*;

public class cff6 {
    public static void main(String[] args) throws IOException {

        Scanner sc=new Scanner(System.in);
        long n=sc.nextLong();
        // int v[]=new int[(int)10e6+1];

        System.out.println(ans(n));
        //etalld(n);
    }
    public static long lcm(long a,long b)
    {
        return a*b/gcd(a,b);
    }
    public static long gcd(long a,long b)
    {
        if(b==0)
        return a;
        
        return gcd(b,a%b);
    }
   public static String ans(long n)
    {
        long max=n;
        for(long j=1;j*j<=n;j++)
        {
            if(n%j==0&&lcm(j,n/j)==n)
            {
                max=j;
            }
        }
        return ""+(max<n/max?max:n/max)+" "+(max>n/max?max:n/max);
        //System.out.println(v);
        
        
      
    }
}