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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import java.math.*;


public class Codeforces2 {
    static long gcd(long a, long b)
    {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }

    // method to return LCM of two numbers
    static long lcm(long a, long b)
    {
        return (a*b)/gcd(a, b);
    }
    public static List<Long> primeFactors(long n)
    {
        // Print the number of 2s that divide n
        List<Long> list=new ArrayList<>();
        while (n%2==0)
        {
            list.add(2L);
            n /= 2;
        }

        // n must be odd at this point.  So we can
        // skip one element (Note i = i +2)
        for (long i = 3; i <= Math.sqrt(n); i+= 2)
        {
            // While i divides n, print i and divide n
            while (n%i == 0)
            {
                list.add(i);
                n /= i;
            }
        }

        // This condition is to handle the case whien
        // n is a prime number greater than 2
        if (n > 2)
            list.add(n);
        return list;
    }
    public static void main(String[] args) throws IOException {

        Scanner s=new Scanner(System.in);
        long X=s.nextLong();

        long sqr= (long) Math.sqrt(X);
        long ans=X;
        long a=1,b=X;
        for(int i=1;i<=sqr;i++)
        {
            if(X%i==0 && gcd(i,X/i)==1)
            {
                long val=Math.max(i,X/i);
                if(val<ans)
                {
                    ans=val;
                    a=i;
                    b=X/i;
                }
            }
        }
        System.out.println(a+" "+b);

//        List<Pair> list=new ArrayList<>();
//        list.add(new Pair(1L,X));
//        for(int i=2;i<=X;i++)
//        {
//            if(X%i==0)
//            {
//                if(i<(X/i))
//                {
//                    list.add(new Pair(i,X/i));
//                }
//            }
//        }
//        long a=1,b=X;
//        for(int i=1;i<list.size();i++)
//        {
//            if(lcm(list.get(i).b,list.get(i).a)==X)
//            {
//                b=list.get(i).b;
//                a=list.get(i).a;
//            }
//        }
//        System.out.println(a+" "+b);
    }
}
class Pair{
    long a,b;
    Pair(long a,long b)
    {
        this.a=a;
        this.b=b;
    }
}