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

public class C_1285 {
	
	static ArrayList<Integer> primes;
	static boolean[] isPrime;
	public static void sieve(int n) {
		primes = new ArrayList<Integer>();
		isPrime = new boolean[n + 1];
		Arrays.fill(isPrime, true);
		isPrime[0] = isPrime[1] = false;
		for(int i = 2; i <= n; i++) {
			if(isPrime[i]) {
				if(1l * i * i <= n)
					for(int j = i * i; j <= n; j += i)
						isPrime[j] = false;
				primes.add(i);
			}
		}
	}
	
	static ArrayList<Long> primeFactors;
	static ArrayList<Integer> primeFactorsCount;
	public static void primeFactors(long n) {
		primeFactors = new ArrayList<>();
		primeFactorsCount = new ArrayList<>();
		for(int p : primes) {
			if(n == 1)
				break;
			if(1l * p * p > n)
				break;
			int c = 0;
			while(n % p == 0) {
				c++;
				n /= p;
			}
			
			if(c > 0) {
				primeFactors.add(1l * p);
				primeFactorsCount.add(c);
			}
		}
		
		if(n > 1) {
			primeFactors.add(n);
			primeFactorsCount.add(1);
		}
	}
	
	public static long pow(long a, long b) {
		long res = 1;
		while(b > 0) {
			if((b & 1) == 1)
				res = res * a;
			a = a * a;
			b >>= 1;
		}
		return res;
	}
	
	static long min, a, b;
	public static void bt(int i, long u, long v) {
		if(i == primeFactors.size()) {
			if(Math.max(u, v) < min) {
				min = Math.max(u, v);
				a = u;
				b = v;
			}
			return;
		}
		bt(i + 1, 1l * u * pow(primeFactors.get(i), primeFactorsCount.get(i)), v);
		bt(i + 1, u, 1l * v * pow(primeFactors.get(i), primeFactorsCount.get(i)));
	}
	
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);
		
		long x = sc.nextLong();
		sieve((int)(Math.sqrt(1.0 * x) + 1.0));
		primeFactors(x);
		
		min = Long.MAX_VALUE;
		a = 0;
		b = 0;
		bt(0, 1, 1);
		
		pw.println(a + " " + b);
		pw.flush();
	}

	public static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}

		public Scanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}

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

		public String nextLine() throws IOException {
			return br.readLine();
		}

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

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

		public char nextChar() throws IOException {
			return next().charAt(0);
		}

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

		public int[] nextIntArray(int n) throws IOException {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		public Integer[] nextIntegerArray(int n) throws IOException {
			Integer[] array = new Integer[n];
			for (int i = 0; i < n; i++)
				array[i] = new Integer(nextInt());
			return array;
		}

		public long[] nextLongArray(int n) throws IOException {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		public double[] nextDoubleArray(int n) throws IOException {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		public static int[] shuffle(int[] a) {
			int n = a.length;
			Random rand = new Random();
			for (int i = 0; i < n; i++) {
				int tmpIdx = rand.nextInt(n);
				int tmp = a[i];
				a[i] = a[tmpIdx];
				a[tmpIdx] = tmp;
			}
			return a;
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
}