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.*;
public class LCM {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		long n = in.nextLong();
		long min = Long.MAX_VALUE;
		long minA = Long.MAX_VALUE;
		long minB = Long.MAX_VALUE;

		for (long i = (int)Math.sqrt(n); i > 0; i--) {
			long a = i;
			long b = 0;
			if (n % a == 0) {
				b = n/a;
				if (min > Math.max(a, b) && isLCM(a, b, n)) {
					min = Math.max(a, b);
					minA = a;
					minB = b;
				}
			}
			else {
				b = 0;
			}
		}
		long x = Math.min(minA, minB);
		long y = Math.max(minA, minB);

		System.out.println(x + " " + y);
	}

	public static long gcd(long a, long b) {
		while (b > 0) {
			long temp = b;
			b = a % b;
			a = temp;
		}
		return a;
	}

	public static boolean isLCM(long a, long b, long lcm) {
		return (a*b / gcd(a, b) == lcm);
		
	}
}