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:
/*
    @Author: Zhiyi Li
    @Date: 2020.01.11
*/
import java.util.*;
public class ProblemC {
    public static void main(String[] argc)
    {
        Scanner sc = new Scanner(System.in);
        long X;
        X = sc.nextLong();
        long a, b;
        a = 0;
        b = 0;
        Map<Long, long[]> map = new HashMap<>();
        long max_v = X + 1;
       for(long i = 1; i*i <= X; i++)
       {
           a = i;
           if(X % a == 0)
           {
               b = X/a;
               if(lcm(a,b) == X)
               {
                   long local_v = Math.max(a, b);
                   if(local_v < max_v)
                   {
                       max_v = local_v;
                       map.put(max_v, new long[]{a, b});
                   }
               }
           }
       }
       System.out.println(map.get(max_v)[0] + " " + map.get(max_v)[1]);
    }

    public static long gcd(long a, long b)
    {
        return a%b == 0? b: gcd(b, a%b);
    }

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