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.lang.reflect.Array;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Stack;

public class Solution {
    public static void main(String[] args){
        Scanner scan=new Scanner(System.in);
        long n=0;

        if(scan.hasNext())
            n=scan.nextLong();

        long k=1;
        for(long i=1;i<Math.sqrt(n);i++){
            if(n%i==0 && gcd(i,n/i)==1){
                k=i;
            }
        }
        long p=n/k;
        if(p>k){
            long temp=p;
            p=k;
            k=temp;
        }
        System.out.println(p+" "+k);
    }
    static long gcd(long a, long b)
    {

        if (a == 0)
            return b;
        if (b == 0)
            return a;
        if (a == b)
            return a;
        if (a > b)
            return gcd(a%b, b);
        return gcd(a, b%a);
    }
}