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:
//package com.company;

import java.util.Scanner;

public class FadiAndLCM {
    public static void main(String[] args) {


        Scanner scanner = new Scanner(System.in);

        long input = scanner.nextLong();

        System.out.println(findPair(input));

        scanner.close();
    }

    public static String findPair(long inputNumber){

        int sqrt = (int) Math.sqrt(inputNumber);
        for (int i = sqrt; i > 0; i--) {
            if (inputNumber % i == 0) {
                if (findGcd(inputNumber / i, i) == 1) {
                    return i + " " + (inputNumber / i);
                }
            }
        }

        return "NO";
    }

    public static long findGcd(long num1, long num2){
        long gcd =1;
        for(int i = 1; i <= num1 && i <= num2; ++i)
        {
// Checks if i is factor of both integers.
            if(num1 % i==0 && num2 % i==0)
                gcd = i;
        }
        return gcd;

    }
}