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.*;

public class C {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        ArrayList<Long> list = new ArrayList<>();
        long A = sc.nextLong();
        int sqrt =(int) Math.sqrt(A);

        for(int i = 1 ; i<= sqrt ; i++)
        {
            if(A%i == 0)
            {
                list.add((A/i));
                list.add((long)i);
            }
        }
        Collections.sort(list);
        int r = list.size()%2 == 0?list.size()/2 - 1:list.size()/2;
        int l = list.size()/2;
        //bf((int)A);

        while(l<list.size())
        {
            long a = list.get(l);
            long b = list.get(r);
            l++;
            r--;
            if(a==b && a!=1)
                continue;
            if((A == lcm(a,b)))
            {
                System.out.println(b+" "+a);
                break;
            }

        }
    }

    static int bf(int n)
    {
        int a =1, b=n;
        for(int i = 1 ;i <  n ;i++)
        {
            for(int j = i+1 ; j< n ;j++)
            {
                if(lcm(i , j) == n)
                {
                    if(Math.max(a,b) > Math.max(i,j))
                    {
                        a = i ;
                        b = j;
                    }
                }
            }
        }
        System.out.println(a +" "+b);
        return 0 ;
    }
    public static long lcm(long number1, long number2) {
        if (number1 == 0 || number2 == 0) {
            return 0;
        }
        long absNumber1 = Math.abs(number1);
        long absNumber2 = Math.abs(number2);
        long absHigherNumber = Math.max(absNumber1, absNumber2);
        long absLowerNumber = Math.min(absNumber1, absNumber2);
        long lcm = absHigherNumber;
        while (lcm % absLowerNumber != 0) {
            lcm += absHigherNumber;
        }
        return lcm;
    }
}