import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int l = 0;
        boolean sigh = false;
        while (l*l*l < n){
            l++;
        }
        if (n == 1 || n == 2)   l--;
        while (!sigh){
            sigh = find(l,n);
            l++;
        }
        System.out.println((l-1) + " " + (n-1));
    }
    public static boolean find(int l,int n){
        for (int i = l; i >= (int)(l/3); i--){
            for (int j = (int)(n/(i+1))-1; j >= 0; j--){
                if (i + j <= l){
                    int k = l - i - j;
                    if (k <= j){
                        if ((i+1)*(j+1)*(k+1)==n){
                            return true;
                        }
                    }
                }
            }
        }
        return false;
    }
}