1000000000000000
 994
 200385
 3842529393411
 8
 409477218238717
 2
 419477218238718
 909383000
 7
 999088000000000
 265
 415000000238718
 780869426483087
 9
 850085504652042
 567000123
 980123123123123
 409477218238719
 385925923480002
 999998169714888
 936302451686999
 114
 999999993700000
 108000000057
 409477218238716
 112
 1
 409477218238718
 999971000299999
 409477318238718
 735412349812385
 113
 999999999999999
 123830583943
 899990298504716
 936302451687000
 995
 990000000000000
 936302451687001
 999986542686123
 850085504652041

18 999999993541753
 12 941
 14 200355
 17 3842529383076
 7 7
 17 409477218238717
 2 2
 18 419466459294818
 16 909381874
 7 7
 18 999087986204952
 11 212
 18 414993991790735
 18 780869407920631
 7 7
 18 850085504652042
 16 566998782
 18 980123123116482
 18 409477218238718
 17 385925923479720
 18 999998150030846
 18 936302448662019
 11 114
 18 999999993541753
 17 107986074062
 17 409477218238710
 10 106
 1 1
 18 409477218238718
 18 999969994441746
 18 409477218238718
 18 735409591249436
 10 113
 18 999999993541753
 17 123830561521
 18 899973747835553
 18 936302448662019
 12 995
 18 989983621692990
 18 936302448662019
 18 999969994441746
 18 850085504650655

import java.io.PrintWriter;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
import java.io.IOException;

public class CodeF1
{

	static long a,b; 
	static long cube(long a){
		return a*a*a;
	}
	static void dfs(long m, long cnt, long min) {
        if (m == 0) {
           if(cnt>a){
           	a=cnt;
           	b=min;
           }
            return;
        }
        long a = 1;
        while (cube(a + 1) <= m) {
            a++;
        }
        dfs(m - cube(a), cnt + 1, min + cube(a));
        if (a - 1 >= 0) {
            dfs(cube(a) - 1 - cube(a - 1), cnt + 1, min + cube(a - 1));
        }
    }
    
    public static void solve() throws IOException{
            nextLine(br);
            long m=nextLong();
            dfs(m,0L,0L);



            


        	




	        	
        	
        	
        	out.println(a+" "+b);
        

        
    }


    public static void main(String[] args) throws IOException
    {
        // genSeive();

        // nextLine(br);
        // int t=nextInt();
        // while(t-- >0)

           solve();
           out.flush();
           out.close();
    }

    static long gcd(long a, long b) { if (b == 0) return a; else return gcd(b, a % b); } 
    static int lcm(int a, int b, int gcdValue) { return Math.abs(a * b) / gcdValue; } 
    static boolean prime[];
    public static void genSeive(){
        prime=new boolean[1000001];
        Arrays.fill(prime,true);
        prime[0]=false;
        prime[1]=false;
        
        for(int i=2;i*i<=1000000;i++)
            if(prime[i])
                for(int j=2*i;j<=1000000;j+=i)
                    prime[j]=false;
        
    }
    
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter out=new PrintWriter(System.out);

    // .....................................input stuff started....................................
private static StringTokenizer st;
    
    public static void nextLine(BufferedReader br) throws IOException
    {
        st = new StringTokenizer(br.readLine());
    }
    
    public static int nextInt()
    {
        return Integer.parseInt(st.nextToken());
    }
    
    public static String next()
    {
        return st.nextToken();
    }
    
    public static long nextLong()
    {
        return Long.parseLong(st.nextToken());
    }

    public static double nextDouble()
    {
        return Double.parseDouble(st.nextToken());
    }
    
       // .....................................input stuff ends....................................




    

   
}