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

public class C {
    public static void main(String[] args) throws Exception {
        FastReader in = new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        long n = in.nextLong();
//        if (n == 1) {
//            out.println(1 + " " + 1);
//            return;
//        }
        FindDiversors(n);
//        if (div.size() == 2) {
//            out.println(1 + " " + n);
//            return;
//        }
//        for (int i = 0; i <div.size() ; i++) {
//            System.out.println(div.get(i));
//        }
        long a = 1, b = n;
        for (long x1 : div) {
            if (lcm(x1, n / x1) == n && Math.max(a, b) > Math.max(x1, n / x1)) {
                a = x1;
                b = n / x1;
            }//if

        }//forx1
        out.println(a + " " + b);
        out.flush();
    }//psvm

    static List<Long> div = new ArrayList<>();

    static void FindDiversors(long n) {// O(sqrt(N))
        for (long i = 1; i * i <= n; ++i) {
            if (n % i == 0) {
                div.add(i);
                long j = n / i;
                if (i != j) {
                    div.add(j);
                }
            }
        }
        Collections.sort(div);
    }

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

    static long lcm(long a, long b) {
        return (long) a / gcd(a, b) * b;
    }

    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

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

        FastReader(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException x) {
                System.out.println(x);
            }
        }

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

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

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

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

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

        boolean hasNext() throws IOException {
            String s = br.readLine();
            if (s == null) {
                return false;
            }
            st = new StringTokenizer(s);
            return true;
        }
    }
}//class
