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.*;
import java.util.*;

public class bear_tower
{
	
	public long floorCube(long n)
	{
		for (long i = 1; i<= n; i++)
		{
			if (i*i*i > n)
				return(i-1);
			else if (i*i*i == n)
				return(i);
		}
		return(0);
		
	}
	
	public long Cube(long j)
	{
		return(j*j*j);
	}
	
	public long NoCubes(long k)
	{
		long volleft = k;
		long num = 0;
			while (volleft != 0)
			{
				long j = floorCube(volleft);
				
				if (j == 1)
				{
					num += volleft; 
					volleft = 0;
					break;
				}		
				
				volleft -= Cube(j); 
				num += 1;					
			}
			
		return(num);
	}
	
	public static void main(String args[])throws IOException
	{
		Scanner sc = new Scanner (System.in);
		long m = sc.nextLong();
		bear_tower dd = new bear_tower();
		long max = 0;
		long X = 0;
		int [] index = new int [(int)(m/(long)Math.sqrt(m)) + 1];
		int [] ind_start = new int [(int)(m/(long)Math.sqrt(m)) ];
		int [] ind_stop = new int [(int)(m/(long)Math.sqrt(m)) ];
		int k = 0;
		for (int i = 0;  i < m ; i+= (int)Math.sqrt(m))
		{
			if (k<=(int)(m/(long)Math.sqrt(m)))
			{
				index[k] = i;
				if (k > 0)
					ind_start[k] = index[k]+1;
				else
					ind_start[k] = index[k];
				
				ind_stop[k] = index[k] + 6;
				k++;
				
			}
			
			
		}
		
		
		long [] to = new long [2];
		long ma = 0;
		
		for (int i = 0; i< ind_start.length; i++)
		{
			long two = Math.max(dd.NoCubes(ind_start[i]), dd.NoCubes(ind_stop[i]));
			//System.out.println(ind_start[i]+"-->"+ind_stop[i]+" "+two+" "+ma);
			if (ma < two)
			{
				to[0] = ind_start[i];
				to[1] = ind_stop[i];
				ma = two;
				
			}
			
		}
			
		
		
		//System.out.println(to[0]+" "+to[1]);
		
		for (long i = to[0]; i <= to[1]; i++)
		{
			if (dd.NoCubes(i) >= max)
			{
				max = dd.NoCubes(i);
				X = i;
			}
		}
		System.out.println(max+" "+X);
		
	}

}
