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.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeMap;

public class ProblemC {
	static int callCount = 0;
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		long m = input.nextLong();
		ArrayList<Long> getCubes = getCubes();
		System.out.println(solve(m, getCubes));
//		System.out.println(callCount);
	}
	public static Answer solve(long m, ArrayList<Long> cubes){
		callCount++;
//		System.out.println(m + " solve called ");
		if(m < 8){
//			System.out.println(m + " solve finished " + new Answer(m, m));
			return new Answer(m, m);
		}
		int maxIdx = (int)(Math.pow(m, 1.0/3.0)+1E-9);
		
		Answer ans1 = solve(m-cubes.get(maxIdx), cubes);
		ans1.n += cubes.get(maxIdx);
		ans1.x += 1;
		
		Answer ans2 = solve(cubes.get(maxIdx)-cubes.get(maxIdx-1)-1, cubes);
		ans2.n += cubes.get(maxIdx-1);
		ans2.x += 1;
		Answer bestAnswer = best(ans1, ans2);
//		System.out.println(m + " solve finished " + bestAnswer);
		return bestAnswer;
	}
	

	private static Answer best(Answer ans1, Answer ans2) {
		if(ans1.x == ans2.x){
			if(ans1.n > ans2.n){
				return ans1;
			}
			else{
				return ans2;
			}
		}
		if(ans1.x > ans2.x){
			return ans1;
		}
		else{
			return ans2;
		}
	}


	public static class Answer{
		long n;
		long x;
		public Answer(long _n, long _x){
			n = _n;
			x = _x;
		}
		public String toString(){
			return x + " " + n;
		}
	}

	private static ArrayList<Long> getCubes() {
		ArrayList<Long> cubes = new ArrayList<Long>();
		for (long a = 0; a < 500000; a++) {
			cubes.add(a * a * a);
		}
		return cubes;
	}

}
