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.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Solution {

	private List<Long> cubs = new ArrayList<Long>();
	
	private Map<Long, List<Long>> map;
	
	private int maxSp;
	
	private void generateCubs(long n) {
		for (long i = 1; cub(i) <= n; i++) {
			cubs.add(cub(i));
		}
	}
	
	private long cub(long x) {
		return x * x * x;
	}
	
	private List<Integer> f(long x) {
		int index = Collections.binarySearch(cubs, x);
		if (index < 0) {
			index = -index - 2;
		}
		
		List<Integer> list = new ArrayList<Integer>();
		for (int i = index; i >= 0; i--) {
			long cub = cubs.get(i);
			while (x >= cub) {
				x -= cub; 
				list.add(i + 1);
			}
		}
		
		return list;
	}
	
	private long[] slow(long n) {
		Long maxN = 0L;
		List<Integer> maxList = new ArrayList<Integer>();
		for (long i = n; i > 0; i--) {
			List<Integer> list = f(i);
			if (list.size() > maxList.size()) {
				maxList = list;
				maxN = i;
			}
		}
		return new long[]{maxList.size(), maxN};
	}
	
	private long[] fast(long n, int sp) {
		//maxSp = Math.max(maxSp, sp);
		//System.out.println(maxSp);
		int index = Collections.binarySearch(cubs, n);
		if (index < 0) {
			index = -index - 2;
		}
		
		List<Long> resList = map.get(n);
		if (resList != null) {
			return new long[]{resList.get(0), resList.get(1)};
		}
		
		if (n < 8) {
			return new long[]{n, n};
		}
		
		long[] res = new long[2];
		
		long startN = n;
		
		if (n > 0) {
			int count = 0;
			long cub = cubs.get(index);
			
			res = fast(Math.min(n, cub - 1), sp + 1);
			
			while (n >= cub) {
				count++;
				n -= cub;
				long[] curRes = fast(Math.min(n, cub - 1), sp + 1);
				curRes[0] += count;
				curRes[1] += count * cub;
				
				if (curRes[0] > res[0] || curRes[0] == res[0] && curRes[1] > res[1]) {
					res[0] = curRes[0];
					res[1] = curRes[1];
				}
			}
		}
		
		map.put(startN, Arrays.asList(res[0], res[1]));
		
		return res;
	}
	
	private void solve() {
		Scanner in = new Scanner(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		
		long n = in.nextLong();
		
		generateCubs(n);
		
		//System.out.println(Arrays.toString(slow(n)));
		
		map = new HashMap<>();
		//System.out.println(Arrays.toString(fast(n, 0)));
		long[] res = fast(n, 0);
		out.println(res[0] + " " + res[1]);
		
		out.flush();
		in.close();
		out.close();
	}
	
	public static void main(String[] args) {
		new Solution().solve();
	}
	
}
