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

public class Main {
	static long X, ans;
	static List<Long> list;

	public static long pow(long x, int y) {
		long res = 1;
		for (int i = 0; i < y; i++) {
			res *= x;
		}
		return res;
	}

	public static void solve(int idx, long val) {
		if (idx == list.size()) {
			ans = Math.min(ans, Math.max(val, X / val));
			return;
		}
		solve(idx + 1, val * list.get(idx));
		solve(idx + 1, val);
	}

	public static void main(String[] args) {
		InputReader in = new InputReader();

		boolean[] isPrime = new boolean[1000001];
		Arrays.fill(isPrime, true);
		isPrime[0] = isPrime[1] = false;
		for (int i = 2; i * i < isPrime.length; i++) {
			if (isPrime[i]) {
				for (int j = i * i; j < isPrime.length; j += i) {
					isPrime[j] = false;
				}
			}
		}
		List<Integer> prime = new ArrayList<>();
		for (int i = 2; i < isPrime.length; i++) {
			if (isPrime[i]) {
				prime.add(i);
			}
		}

		X = Long.parseLong(in.next());
		Map<Long, Integer> map = new TreeMap<>();
		long Y = X;
		for (long x : prime) {
			int cnt = 0;
			while (Y % x == 0) {
				Y /= x;
				cnt++;
			}
			if (cnt > 0) {
				map.put(x, cnt);
			}
		}
		if (Y > 1) {
			map.put(Y, 1);
		}

		list = new ArrayList<>();
		for (Map.Entry<Long, Integer> entry : map.entrySet()) {
			list.add(pow(entry.getKey(), entry.getValue()));
		}

		ans = Long.MAX_VALUE;
		solve(0, 1);

		System.out.println(X / ans + " " + ans);
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer st;

		public InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(nextLine());
			}
			return st.nextToken();
		}

		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return null;
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}
	}
}