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.lang.*;
import java.io.*;
public class Main{
static long gcdEuclid(long a,long b) {
		if(b==0) return a;
		else return gcdEuclid(b,a%b);
	}
	
	static long lcm(long a,long b) {
		long gcd = gcdEuclid(a,b);
		return (a*b)/gcd;
	}
	
		
		public static void main(String[] args) {
			
			Scanner sc = new Scanner(System.in);
			long num = sc.nextLong();
			
			if(num==1){
			    System.out.println("1 1");
			    return;
			}
			
			long i = (long)Math.sqrt(num);
			long j=1;
			for(;i>=1;i--) {
				if(num%i==0) {
					 j = num/i;
					if(i!=j && lcm(i,j)==num) break;
				}
				
			}
			System.out.println(i+ " " + j);
		}
}