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

/**
 * Created by liwj
 * date:2019/9/21
 * comment:cf
 */
public class CodeForces {

    private static boolean isPrime(long x) {
        if (x <= 3) return true;
        for (long i = 2; i * i <= x; i++) {
            if (x % i == 0) return false;
        }
        return true;
    }

    private static long gcd(long m, long n) {
        return m % n == 0 ? n : gcd(n, m % n);
    }

    public static void main(String[] args) throws Exception {

        Scanner cin = new Scanner(System.in);
        long x = cin.nextLong();

        if (isPrime(x)) {
            System.out.println("1 " + x);
        } else {
            long ansa = 1;
            long ansb = x;
            for (long i = 1; i * i <= x; i++) {
                if (x % i == 0) {
                    long a = i;
                    long b = x / a;
                    long gcd = gcd(b, a);
                    if (b < ansb && (gcd == 1)) {
                        ansa = a;
                        ansb = b;
                    }
                }
            }
            System.out.println(ansa + " " + ansb);
        }
    }
}