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.io.*;
public class C {
   public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      
      long n = sc.nextLong();
      ArrayList<Long> list = new ArrayList<Long>();
      for(long i = 1; i <= (long)Math.sqrt(n); i++) {
         if(n % i == 0) list.add(i);
      }
      
      Collections.sort(list);
      Collections.reverse(list);
      
      for(long x : list) {
         long g = gcd(n / x, x);
         
         if(g == 1) {
            System.out.println(x + " " + (n / x));
            return;
         }
      }
   }
   
   public static long gcd(long a, long b) {
      if(b == 0) return a;
      return gcd(b, a % b);
   }
}