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.math.BigInteger;
import java.lang.Math;

public class Sample
{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        long n=sc.nextLong();
        int ans=0;
        for(int i=(int)Math.sqrt(n);i>=1;i--)
        {
            if(n%i==0 && lcm(i,n/i)==n)
            {
                ans=i;
                break;
            }
        }
        System.out.println(ans+" "+(n/ans));

    }

    // static long gcd(long a, long b) 
    // { 
    // if (a == 0) 
    //     return b; 
    // return gcd(b % a, a); 
    // }
    
    static int gcd(long a, long b) {
    BigInteger b1 = BigInteger.valueOf(a);
    BigInteger b2 = BigInteger.valueOf(b);
    BigInteger gcd = b1.gcd(b2);
    return gcd.intValue();
}


    static long lcm(long a,long b)
    {
        return( a/gcd(a,b) *b);
    }
}