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.lang.reflect.Array;
import java.security.acl.LastOwnerException;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.stream.Collectors;


public class Main {
    static Long max = (long) (2 * 10E5);
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

    // Arrays.stream(br.readLine().split("\\s+")).map(Integer::parseInt).toArray(Integer[]::new);
    // Arrays.stream(br.readLine().split("\\s+")).map(Long::parseLong).toArray(Long[]::new);
    // Integer.parseInt(br.readLine());
    // Long.parseLong(br.readLine());

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

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

    public static void main(String[] args) throws IOException {
//        int t = Integer.parseInt(br.readLine());
//        for (int _t = 0; _t < t; _t++) {
        long x = Long.parseLong(br.readLine());
        long min = Long.MAX_VALUE, mina = -1, minb = -1;
        for (int a = 1; a <= Math.sqrt(x) + 1; a++) {
            if (x % a == 0 && lcm(a, x/a) == x){
                if (Math.max(a, x/a) < min){
                    min = Math.max(a, x/a);
                    mina = a;
                    minb = x/a;
                }
            }
        }
        if (mina == -1 && minb == -1) {
            mina = 1;
            minb = x;
        }
        System.out.println(mina + " " + minb);

//        }
    }
}