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.Scanner;
public class Main {
	private static int[] ans=new int[1000001];
	public static void main(String[] args){
		Scanner cin=new Scanner(System.in);
		long x=cin.nextLong();
		long max=0;
		if(check(x)||x==1) {
			System.out.println(1+" "+x);
			return;
		}
		for(long i=1;i*i<=x;i++) {
			if(lcm(i,x/i)==x&&gcd(i,x/i)==1) {
				max=Math.max(max, i);
			}
		}
		System.out.println(max+" "+x/max);
	}
	public static long gcd(long m,long n) {
		return m%n==0?n:gcd(n,m%n);
	}
	public static long lcm(long m,long n) {
		return m*n/gcd(m,n);
	}
	public static boolean check(long n) {
		if(n<2) return false;
		for(int i=2;i<=Math.sqrt(n);i++) {
			if(n%i==0) return false;
		}
		return true;
	}
}