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.HashMap;
import java.util.StringTokenizer;


public class Main {
    static long INF = (long) 1e18;
    static HashMap<Long, Integer> primes;

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        long x = sc.nextLong();
        primes = new HashMap<>();
        long tmp = x;
        for (int i = 2; 1l * i * i <= tmp; i++) {
            while (tmp % i == 0) {
                tmp /= i;
                primes.put(1l * i, primes.getOrDefault(1l * i, 0) + 1);
            }
        }
        if (tmp != 1) primes.put(tmp, 1);
        long a = 1, b = x;
        for (int i = 1; 1l * i * i <= x; i++) {
            if (x % i != 0) continue;
            long aa = i, bb = getB(aa);
            if (Math.max(aa, bb) < Math.max(a, b)) {
                a = aa;
                b = bb;
            }
            aa = x / i;
            bb = getB(aa);
            if (Math.max(aa, bb) < Math.max(a, b)) {
                a = aa;
                b = bb;
            }
        }
        out.println(a + " " + b);
        out.flush();
        out.close();
    }

    static long getB(long a) {
        long res = 1;
        for (long p : primes.keySet()) {
            int e = primes.get(p);
            int ee = 0;
            while (a % p == 0) {
                ee++;
                a /= p;
            }
            if (ee != e)
                while (e-- > 0) res *= p;
        }
        return res;
    }


    static class Scanner {

        StringTokenizer st;
        BufferedReader br;

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

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


        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[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

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


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

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

        public short nextShort() throws IOException {
            return Short.parseShort(next());
        }

    }

}