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.util.*;
import java.io.*;

public class c {
   public static void main(String[] Args) 
      throws Exception
   {
      FS sc = new FS(System.in);
      long t = sc.nextLong();
      long ans = 1;
      while(ans * ans < t)
         ans++;
      while (true){
         if (t % ans == 0 && gcd(t/ans, ans) == 1)
         {
            System.out.println(ans +" " +(t/ans));
            return;
         }
         ans--;
      }
   }

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

   public static class FS {
      StringTokenizer st;
      BufferedReader br;

      FS(InputStream in)
         throws Exception
      {
         br = new BufferedReader(new InputStreamReader(in));
         st = new StringTokenizer(br.readLine());
      }

      String next()
         throws Exception
      {
         if (st.hasMoreTokens())
            return st.nextToken();
         st = new StringTokenizer(br.readLine());
         return next();
      }

      int nextInt()
         throws Exception
      {
         return Integer.parseInt(next());
      }
      long nextLong()
         throws Exception
      {
         return Long.parseLong(next());
      }
   }
}
