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 C {
	public static void main (String[] args) throws java.lang.Exception {
		new Solution();
	}
}
class Solution {
	Scanner scanner;
	public Solution() {
		scanner = new Scanner(System.in);

		while (scanner.hasNext()) {
			// int T = Integer.parseInt(scanner.nextLine());

			// for (int i=0; i<T; i++) {
				run_case();
			// }
		}
	}

	private void run_case() {
		long n = Long.parseLong(scanner.nextLine());

		long cur_min = n;

		// System.out.println();
		for (long cur = 1; cur * cur <= n; cur ++) {
			if (n % cur == 0) {
				long a = cur;
				long b = n / cur;
				if (gcd(a, b) == 1) {
					cur_min = Math.min(cur_min, b);
				}
				// System.out.println(a + " " + b);
			}
		}
		System.out.println(cur_min + " " + n / cur_min);
	}

	private long gcd(long a, long b) {
	    if (b == 0) return a;
	    else return gcd(b, a%b);
	}

}