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.util.*;
import java.io.*;
import java.math.*;
 
public class A {
 
    public static void main(String[] args) throws Exception {
        // FileInputStream inputStream = new FileInputStream("input.txt");
        // FileOutputStream outputStream = new FileOutputStream("output.txt");
 
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
         
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
 
        Solver solver = new Solver();     
        // int t = in.nextInt();
        int t = 1;
        for (int i = 0 ; i < t ; i++) {
            solver.solve(1, in, out);
        }
                 
        out.close();
    }
 
    static class Solver {

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            long n = in.nextLong();
            long i = 1;
            long res = Long.MAX_VALUE;
            while (i * i <= n) {
                if (n % i == 0) {
                    long o = n / i;
                    if (i != o) {                        
                        if (LCM(i, o) == n) {
                            long max = Math.max(o, i);    
                            res = Math.min(res, max);
                        }                        
                    }
                }
                i += 1L;
            }
            if (res == Long.MAX_VALUE) res = 1;
            out.println(res + " " + (n / res));
        }

        public long LCM(long a, long b) {
            return (a * b) / GCD(a, b);
        } 

        public long GCD(long a, long b) {
            return (b == 0 ? a : GCD(b, a % b));
        }


    }

    
             
 
    static class InputReader {
 
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
        public long nextLong() {
            return Long.parseLong(next());
        }
 
        public double nextDouble() {
            return Double.parseDouble(next());
        }
 
        public float nextFloat() {
            return Float.parseFloat(next());
        }
    }
}