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

public class Main {
    static ArrayList<Integer> primes;
    public static void sieve(){
        primes = new ArrayList<>();
        int n = 2_500_005;
        boolean[] isPrime = new boolean[n]; isPrime[0] = isPrime[1] = false;
        Arrays.fill(isPrime, true);
        int i = 2;
        for (; i*i < n; i++) {
            if(isPrime[i]){
                primes.add(i);
                for (int j = i*i; j < n; j += i) {
                    isPrime[j] = false;
                }
            }
        }
        for (; i < n; i++) {
            if(isPrime[i]) primes.add(i);
        }
    }

    static ArrayList<Integer> primeFactors(int N){	// O(sqrt(N) / ln sqrt(N)){
        ArrayList<Integer> factors = new ArrayList<Integer>();		//take abs(N) in case of -ve integers
        int idx = 0, p = primes.get(idx);

        while(p * p <= N)
        {
            while(N % p == 0) { factors.add(p); N /= p;}
            p = primes.get(++idx);
        }

        if(N != 1)						// last prime factor may be > sqrt(N)
            factors.add(N);				// for integers whose largest prime factor has a power of 1
        return factors;
    }


    public static long gcd(long a, long b){
        if(b == 0) return a;
        else return gcd(b, a%b);
    }
    public static long lcm(long a, long b){
        return a*b/gcd(a,b);
    }

    public static void main(String[] args) throws IOException, InterruptedException {
        long x = sc.nextLong();
        long f = 1, s = x;
        for (long i = 1; i*i <= x; i++) {
            if(x % i == 0){
                if(lcm(i, x/i) == x && Math.max(i, x/i) < Math.max(f,s)){
                    f = i; s = x/i;
                }
            }
        }
        pw.println(f + " " + s);
        pw.close();
    }

    public static void pairSort(Pair[] arr) {
        ArrayList<Pair> l = new ArrayList<>();
        Collections.addAll(l, arr);
        Collections.sort(l);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = l.get(i);
        }
    }
    public static void longSort(long[] arr) {
        ArrayList<Long> l = new ArrayList<>();
        for (long i : arr) l.add(i);
        Collections.sort(l);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = l.get(i);
        }
    }
    public static void intSort(int[] arr) {
        ArrayList<Integer> l = new ArrayList<>();
        for (int i : arr) l.add(i);
        Collections.sort(l);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = l.get(i);
        }
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

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

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

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

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

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

        public double nextDouble() throws IOException {
            String x = next();
            StringBuilder sb = new StringBuilder("0");
            double res = 0, f = 1;
            boolean dec = false, neg = false;
            int start = 0;
            if (x.charAt(0) == '-') {
                neg = true;
                start++;
            }
            for (int i = start; i < x.length(); i++)
                if (x.charAt(i) == '.') {
                    res = Long.parseLong(sb.toString());
                    sb = new StringBuilder("0");
                    dec = true;
                } else {
                    sb.append(x.charAt(i));
                    if (dec)
                        f *= 10;
                }
            res += Long.parseLong(sb.toString()) / f;
            return res * (neg ? -1 : 1);
        }

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

        public int[] nextIntArr(int n) throws IOException {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = Integer.parseInt(next());
            }
            return arr;
        }

        public long[] nextLongArr(int n) throws IOException {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = Long.parseLong(next());
            }
            return arr;
        }

    }
    static class Pair implements Comparable<Pair>{
        int first; int second;
        public Pair(int first, int second){
            this.first = first; this.second = second;
        }

        @Override
        public int compareTo(Pair p2) {
            if(second == p2.second) return first - p2.first;
            else return second - p2.second;
        }

        @Override
        public String toString() { return "("+ first + "," + second + ')'; }
    }
    static class Triple implements Comparable<Triple> {
        double x, y, z, sum;

        Triple(double a, double b, double c) { x = a; y = b; z = c; sum = x + y + z; }


        public int compareTo(Triple t)
        {
            if(Math.abs(sum - t.sum) < 1e-9) return x > t.x ? 1 : -1;
            return sum > t.sum ? 1 : -1;
        }
        public String toString()
        {
            return x + " " + y  + " " + z;
        }
    }

    static PrintWriter pw = new PrintWriter(System.out);
    static Scanner sc = new Scanner(System.in);
    static Random random = new Random();
    static final long MOD = 1073741824;
}