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 <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(int i = 0; i < n; i++)



int main() {
    int s4[101];
    vector<int> s4_k;
    REP(i, 101){
        s4[i] = i * (i + 1) * (i + 2) / 6;
        if(s4[i] & 1){
            s4_k.push_back(i * (i + 1) * (i + 2) / 6);
            // cout << s4[i] << endl;
        }
    }
    
    int n;
    cin >> n;
    while(n != 0){
        vector<vector<int>> dp(102, vector<int>(n + 1, 1e9));
        dp[0][0] = 0;
        
        for(int i = 1; i <= 101; i++){
            REP(j, n + 1){
                if(s4[i - 1] <= j){
                    dp[i][j] = min(dp[i - 1][j], dp[i][j - s4[i - 1]] + 1);
                }
                else{
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }
        
        /*
        REP(i, 5){
            REP(j, n + 1){
                cout << dp[i][j] << ' ';
            }
            cout << endl;
        }
        */
        
        cout << dp[101][n] << ' ';
        
        
        
        REP(i, s4_k.size() + 1){
            REP(j, n + 1){
                dp[i][j] = 1e9
                ;
            }
        }
        dp[0][0] = 0;
        
        for(int i = 1; i <= s4_k.size(); i++){
            REP(j, n + 1){
                if(s4_k[i - 1] <= j){
                    dp[i][j] = min(dp[i - 1][j], dp[i][j - s4_k[i - 1]] + 1);
                }
                else{
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }
        
        /*
        REP(i, 5){
            REP(j, n + 1){
                cout << dp[i][j] << ' ';
            }
            cout << endl;
        }
        */
        
        cout << dp[s4_k.size()][n] << endl;
        
        
        
        cin >> n;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;

#define N 1000007
ll s[N], t[N];

int main() {

    for(ll i=0; i<N; ++i) s[i] = t[i] = 10000000;
    s[0] = t[0] = 0;
    for(ll i=0; i<N; ++i) {
        ll j = 1;
        while(i + j*(j+1)*(j+2)/6 < N) {
            ll p = j*(j+1)*(j+2)/6;
            s[i+p] = min(s[i]+1, s[i+p]);
            if(p % 2 == 1) {
                t[i+p] = min(t[i]+1, t[i+p]);
            }
            ++j;
        }
    }

    int n;
    while(cin >> n && n) {
        cout << s[n] << " " << t[n] << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define req(i,r,k) for(int i=k;i<r;i++)
#define rep(i,r) req(i,r,0)
const int INF = 10000;

int dp[1000000];
int odddp[1000000];

const long  int h = 180,nmax=1000000;

int main() {

    int n,a,a2;

    vector<int> t;
    vector<int> oddt;

    req(i,200,1){
        t.push_back(i * (i+1) * (i+2) / 6);
        if(t[i-1]%2 == 1){
            oddt.push_back(t[i-1]);
        }
        if(t[i-1] > 1000000) {
            t.erase(t.end() - 1);
            break;
        }
    }

    rep(i,nmax){
        dp[i] = INF;
        odddp[i] = INF;
    }

    /*rep(i,20){
        rep(j,41){
            cout << dp[i][j] << " ";
        }
        cout << endl;
    }*/

/*
    rep(i,oddh){
        odddp[i][0] = 0;
    }
*/

    /*rep(i,oddh){
        cout << t[i*2] << endl;
    }*/

    dp[0] = 0;
    odddp[0] = 0;


    rep(i,h){
        rep(j,nmax){
            if(j >= t[i]){
                dp[j] = min(dp[j],dp[j-t[i]] + 1);
            }
            else{
                dp[j] = dp[j];
            }
        }
    }

    int oddh;

    oddh = oddt.size();

    rep(i,oddh){
        rep(j,nmax){
            if(j >= oddt[i]){
                odddp[j] = min(odddp[j],odddp[j-oddt[i]] + 1);
            }
            else{
                odddp[j] = odddp[j];
            }
        }
    }

    while(1){

        cin >> n;
        if(n==0) break;


        printf("%d %d\n",dp[n],odddp[n]);

        /*if(dp[h-1][n] == INF){
            rep(i,h){
                rep(j,namx){
                    if(j >= t[i]){
                        dp[i+1][j] = min(dp[i][j],dp[i][j-t[i]] + 1);
                    }
                    else{
                        dp[i+1][j] = dp[i][j];
                    }
                }
            }
        }

        cout << dp[h-1][n] << ' ';
         */
/*
        if(odddp[oddh-1][n] == INF){
            rep(i,oddh){
                rep(j,w){
                    if(j >= t[i]){
                        dp[i+1][j] = min(dp[i][j],dp[i][j-t[i]] + 1);
                    }
                    else{
                        dp[i+1][j] = dp[i][j];
                    }
                }
            }
        }

        cout << odddp[h-1][n] << endl;
*/
    }




    return 0;
}