Go: package main

import (
	"bufio"
	_ "container/heap"
	"fmt"
	"os"
	_ "sort"
	"strconv"
)

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func lcm(a, b int) int {
	return a / gcd(a, b) * b
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
const MOD = int(1e+9) + 7
const INF = 1 << 60

func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	defer wtr.Flush()
	var nums []int
	for i := 1; i < 2*100+1; i++ {
		nums = append(nums, i*(i+1)*(i+2)/6)
	}
	var ins []int
	N := 0
	for true {
		n := sc.nextInt()
		if n == 0 {
			break
		}
		ins = append(ins, n)
		N = max(N, n)
	}
	dp := make([]int, N+1)
	dp2 := make([]int, N+1)
	for i := 1; i < N+1; i++ {
		dp[i] = INF
		dp2[i] = INF
	}
	for i := 0; i < len(nums); i++ {
		n := nums[i]
		if n > N {
			break
		}
		for j := 0; j < N+1; j++ {
			if j >= n {
				dp[j] = min(dp[j], dp[j-n]+1)
				if n%2 != 0 {
					dp2[j] = min(dp2[j], dp2[j-n]+1)
				}
			}
		}
	}
	for i := 0; i < len(ins); i++ {
		fmt.Fprintln(wtr, dp[ins[i]], dp2[ins[i]])
	}
}

C++: #include <iostream>
using namespace std;

int dp[1000001];

int nums[200] = {0};

int main(){

    for(int i = 0;i < 200;i++) nums[i] = i * (i + 1) * (i + 2) / 6;

    int n;
    while(1){
        cin >> n;
        if(n == 0) break;

        for(int i = 0;i <= n;i++) dp[i] = 100002;
        dp[0] = 0;

        for(int j = 1;nums[j] <= n;j++) {
            for(int i = nums[j];i <= n;i++) {
                if(dp[i] > dp[i - nums[j]] + 1) dp[i] = dp[i - nums[j]] + 1;
            }
        }

        cout << dp[n] << ' ';

        for(int i = 0;i <= n;i++) dp[i] = 100002;
        dp[0] = 0;

        for(int j = 1;nums[j] <= n;j++) {
            if(nums[j] % 2 != 1) continue;
            //cout << num << endl;
            for(int i = nums[j];i <= n;i++) {
                if(dp[i] > dp[i - nums[j]] + 1) dp[i] = dp[i - nums[j]] + 1;
                //cout << dp[i] << ' ';
            }
            //cout << endl;
        }

        cout << dp[n] << endl;
    }
}

C++: /* C ????§????: ?????? */
#include<bits/stdc++.h>
#define dump(a) cout << (#a) << (a) << endl
using namespace std;

#define MAX_SIZE 2000002

//pollok
int memo_cnt[MAX_SIZE]; //MAX_SIZE??????
vector<int> all_pks;
vector<int> kisu_pks;

//P=pk??????, index=pks????????¨?????´???
int dfs(const int P, vector<int> &pks)
{
	//dump(level);
	if (P == 0) { return 0; }
	if (memo_cnt[P] != -1) { return memo_cnt[P]; } //?????¢????????\
	
	int min_depth = INT_MAX;
	//100??????
	for(int i=0; i<pks.size(); i++) { //??§?????????
		int next_P = P-pks[i];
		if (next_P >= 0) {
			int depth = dfs(next_P, pks) + 1; //????????°???????????????
			min_depth = min(min_depth,depth); //????°????????????°
		}
		//?????????????????´???????¬?
	}
	//???????????¢???
	memo_cnt[P] = min_depth;
	
	return min_depth;
}

int main() {
	int n=1;
	while(true) {
		int pk = n * (n+1) * (n+2) / 6;
		if (pk >= MAX_SIZE){ break; }

		all_pks.push_back(pk);
		if (pk % 2 != 0) { kisu_pks.push_back(pk); }
		n++;
	}
	reverse(begin(all_pks),end(all_pks));
	reverse(begin(kisu_pks),end(kisu_pks));

	int P;
	while(cin >> P) {
		if (P == 0) { break; }

		int index=0; //
		int left=0,right=0;
		for(int i=0; i<MAX_SIZE; i++) { memo_cnt[i] = -1; }
		left = dfs(P, all_pks);

		for(int i=0; i<MAX_SIZE; i++) { memo_cnt[i] = -1; }
		right = dfs(P, kisu_pks);
		cout << left << " " << right << endl;
	}


	return EXIT_SUCCESS;
}