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

public class Main {

    public static void main(String[] args) {
	// write your code here
        Scanner s = new Scanner(System.in);
//   B
long x=s.nextLong();
long a=(long)Math.sqrt(x);int flag=0;long min=Long.MAX_VALUE;long A=0;long B=0;
for(long i=1;i<=(long)Math.sqrt(x);i++){
    if(x%i==0){flag=1;
    if(Math.max(i,x/i)<min&&lcm(i,x/i)==x){
        min=Math.max(i,x/i);A=i;B=x/i;
    }
 //       System.out.println(i+" "+(x/i));break;
    }
}if(flag==0) {
            System.out.println(x+" "+1);
        }else{
            System.out.println(A+" "+B);
        }
    }
    static long gcd(long a, long b)
    {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }

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