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
import java.io.*;
import java.text.*;
import java.util.*;
 
public class Ash3 {
 
	static boolean multipleTC = false;
	static long mod = (long) 1e9 + 7;
 
	void solve(int TC) throws Exception {
		long n = in.nl();
		long x = n, y = 1;
		for (long i = 1; i * i <= n; i++) {
			if (n % i == 0) {
				long a = i, b = n / i;
				if (x > Math.max(a, b) && n == (a * b) / gcd(a, b)) {
					x = Math.max(a, b);
					y = Math.min(a, b);
				}
			}
		}
		pl(y+" "+x);
	}
 
	public static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}
 
	DecimalFormat df = new DecimalFormat("0.00000000000");
	FastReader in;
	PrintWriter out;
 
	void run() throws Exception {
		in = new FastReader();
		out = new PrintWriter(System.out);
		int T = (multipleTC) ? in.ni() : 1;
		pre();
		for (int t = 1; t <= T; t++)
			solve(t);
		out.flush();
		out.close();
	}
 
	public static void main(String[] args) throws Exception {
		new Ash3().run();
	}
 
	void pre() throws Exception {
	}
 
	void p(Object o) {
		out.print(o);
	}
 
	void pl(Object o) {
		out.println(o);
	}
 
	void pni(Object o) {
		out.println(o);
		out.flush();
	}
 
	class FastReader {
		BufferedReader br;
		StringTokenizer st;
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		public FastReader(String s) throws Exception {
			br = new BufferedReader(new FileReader(s));
		}
 
		String next() throws Exception {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					throw new Exception(e.toString());
				}
			}
			return st.nextToken();
		}
 
		String nextLine() throws Exception {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				throw new Exception(e.toString());
			}
			return str;
		}
 
		int bit(long n) {
			return (n == 0) ? 0 : (1 + bit(n & (n - 1)));
		}
 
		String n() throws Exception {
			return in.next();
		}
 
		String nln() throws Exception {
			return in.nextLine();
		}
 
		int ni() throws Exception {
			return Integer.parseInt(in.next());
		}
 
		long nl() throws Exception {
			return Long.parseLong(in.next());
		}
 
		double nd() throws Exception {
			return Double.parseDouble(in.next());
		}
	}
}