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:
//package jan2020;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class FadiANDLCM {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		FastReader scn = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		long x = scn.nextLong();
		long max = Long.MAX_VALUE;
		long v1 = 0;
		long v2 = 0;
		for (long i = 1; i * i <= x; i++) {
			if (x % i == 0) {
				long a = i;
				long b = x / i;
				if(a==x || b==x)
				{
					long val = Math.max(a, b);
					{
						max = Math.min(max, val);
						if(((a*b)/gcd(a,b))==x)
						{
						v1 = a;
						v2 = b;
						}
					}
				}
				else{
					if (a != b) {
						if ((a % b)==0 || (b % a)==0) {
							
						}
						else
						{
							long val = Math.max(a, b);
							{
								max = Math.min(max, val);
								if(((a*b)/gcd(a,b))==x)
								{
								v1 = a;
								v2 = b;
								}
							}
							
						}
					}
				}
				
			}
		}
		//System.out.println(max);
		out.println(v1 + " " + v2);
		out.close();

	}
	static long gcd(long a, long b) 
	{ 
	    if (a == 0) 
	        return b; 
	    return gcd(b % a, a); 
	} 
	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

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

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

}