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:
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.*;
import java.util.*;
public class C1285 {
    public static void main(String args[])throws IOException
        {
            Scanner sc=new Scanner(System.in);
            long n=sc.nextLong(),max=Long.MAX_VALUE,a=0,b=0;
            for(long i=1;i<=(long)Math.sqrt(n);i++)
            {
                if(n%i==0)
                {
                    long t1=i,t2=n/i;
                    long gcd=find(t1,t2);
                    if(gcd==1)
                    {
                        long m=Math.max(t1,t2);
                        if(m<max)
                        {
                            a=t1;b=t2;
                            max=m;
                        }
                    }
                }
            }
            System.out.println(a+" "+b);
        }
    static long find(long a,long b)
    {
        if(b==0)
            return a;
        else
            return find(b,a%b);
    }

}