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.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class EduDIv2jUNE {
        static boolean isPrime(long n)
    {
        int flag=0;
        for(long i=2;i*i<n;i++)
        {
            if(n%i==0)
            {
                flag=1;
                break;
            }
        }
        if(flag==1)
            return false;
        return true;
    }
    static long gcd(long a,long b)
    {
        if(b==0)
            return a;
        else
            return gcd(b,a%b);
    }

    public static void main(String[] args) {
    
        long max1=1;
        Scanner sc=new Scanner(System.in);
        long n=sc.nextLong();
        if(isPrime(n))
            System.out.println("1 "+n);
        else
        {
            for(long i=1;i*i<n;i++)
            {
                if(n%i==0)
                {
                    if(gcd(i,n/i)==1)
                        max1=i;
                }
            }
        
        if(max1!=1)
            System.out.println(Math.min(n/max1,max1)+" "+Math.max(n/max1,max1));
        else
            System.out.println("1 "+n); 
            }
    }
}