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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.*;

public class R4 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long k     = sc.nextLong();
        cube = new long[100001];
        maxtotal = Long.MIN_VALUE;
        maxcount = Long.MIN_VALUE;
        for(long i=1;i<=100000;i++)
            cube[(int)i] = i*i*i;


        calc(k,0,0);

        System.out.println(maxcount+" "+maxtotal);

    }

    public static long cube[],maxtotal,maxcount;

    static long powCub(long x)
    {
        return x*x*x;
    }

    public static void calc(long m,long count,long total)
    {

        if(m==0)
        {
            if(maxcount == count)
            {
                maxtotal = Math.max(total,maxtotal);
            }
            else if(maxcount<count)
            {
                maxcount=count;maxtotal = total;


            }
            return;
        }
        int index = Arrays.binarySearch(cube,m);

        if(index<0)
        {index = -1*(index+1);
            index--;}

        calc(m-cube[index],count+1,total+cube[index]);

        if(index>1)
            calc(cube[index]-1-cube[index-1],count+1,total+cube[index-1]);





    }


}