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

public class C1285 {
    private static final int MAX_N = 1000000;
    private static Integer[] prime = new Integer[MAX_N+1];
    private static boolean[] primeVis = new boolean[MAX_N+1];
    private static int primeIndex  = 0;

    static class InputSupport{
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        Integer getInt() throws Exception {
            return Integer.valueOf(br.readLine());
        }

        Integer[] getIntArray(int n) throws Exception {
            String s = br.readLine();
            Integer[] result = new Integer[n];
            String[] strings = s.split(" ");
            for(int i = 0;i<n;i++){
                result[i] = Integer.valueOf(strings[i]);
            }
            return result;
        }

        Long getLong() throws Exception {
            return Long.valueOf(br.readLine());
        }

        Long[] getLongArray(int n) throws Exception {
            String s = br.readLine();
            Long[] result = new Long[n];
            String[] strings = s.split(" ");
            for(int i = 0;i<n;i++){
                result[i] = Long.valueOf(strings[i]);
            }
            return result;
        }

        Double getDouble() throws Exception {
            return Double.valueOf(br.readLine());
        }

        Double[] getDoubleArray(int n) throws Exception {
            String s = br.readLine();
            Double[] result = new Double[n];
            String[] strings = s.split(" ");
            for(int i = 0;i<n;i++){
                result[i] = Double.valueOf(strings[i]);
            }
            return result;
        }

    }

    public static void main(String[] args) throws Exception {
        InputSupport inputSupport = new InputSupport();
        primeInit(1000000);
        long x = inputSupport.getLong();
        long a = 1,b = x;
        long ans = Math.max(a,b);
        for(long i = 1;i*i<x;i++){
            if (x % i == 0 && i*(x/i)/gcd(i,x/i) == x) {
                long tmp = Math.max(i, x / i);
                if (tmp < ans) {
                    ans = tmp;
                    a = i;
                    b = x / i;
                }
            }
        }
//        System.out.println(ans);
        System.out.println(a+" "+b);
    }

    private static long gcd(long a,long b){
        if(b == 0){
            return a;
        }
        return gcd(b,a%b);
    }

    private static void primeInit(int max){
        for(int i = 2;i<=max;i++){
            if(!primeVis[i]){
                prime[primeIndex++] = i;
            }
            for(int j = 2;j*i<=max;j++){
                primeVis[i*j] = true;
            }
        }
    }
}