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 B {

	static HashMap<Long, pair> memo;

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

	static class pair {
		long sum;
		int cubes;

		pair(long s, int c) {
			sum = s;
			cubes = c;
		}

		static pair max(pair a, pair b) {
			int c;
			long s;
			if (a.cubes > b.cubes) {
				c = a.cubes;
				s = a.sum;
			} else if (b.cubes > a.cubes) {
				c = b.cubes;
				s = b.sum;
			} else {
				c = b.cubes;
				s = Math.max(a.sum, b.sum);
			}
			return new pair(s, c);
		}

		protected pair clone() {
			return new pair(sum, cubes);
		}

	}

	static pair solve(long x) {
		if (x == 0)
			return new pair(0, 0);
		if (memo.containsKey(x))
			return memo.get(x);
		pair ans = new pair(0, 0);
		long max = (long) Math.pow(x, 1.0 / 3);
//		for (long max = 1; cube(max) <= x; max++) {
		long cube = cube(max);
		long rem = Math.min(x, cube(max + 1) - 1) - cube;
		pair cand = solve(rem).clone();
		cand.cubes++;
		cand.sum += cube;
		ans = pair.max(ans, cand);

		ans = pair.max(ans, solve(cube - 1));

//		}

		memo.put(x, ans);
		return ans;
	}

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner();
		PrintWriter out = new PrintWriter(System.out);
		long n = sc.nextLong();
		memo = new HashMap<Long, pair>();
		pair ans = solve(n);
		out.println(ans.cubes + " " + ans.sum);
		out.close();

	}

	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		Scanner(String fileName) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(fileName));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

		int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(next());
		}

		boolean ready() throws IOException {
			return br.ready();
		}

	}

	static void sort(int[] a) {
		shuffle(a);
		Arrays.sort(a);
	}

	static void shuffle(int[] a) {
		int n = a.length;
		Random rand = new Random();
		for (int i = 0; i < n; i++) {
			int tmpIdx = rand.nextInt(n);
			int tmp = a[i];
			a[i] = a[tmpIdx];
			a[tmpIdx] = tmp;
		}
	}

}