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;
#define MAX 1000000
#define INF 1000000000

int dp1[MAX+1],dp2[MAX+2];

int main() {
    for(int i = 1;i <= MAX;i++) {
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1;n * (n + 1) * (n + 2) / 6 <= MAX;n++) {
        int a = n * (n + 1) * (n + 2) / 6;
        for(int i = a;i <= MAX;i++) {
            dp1[i] = min(dp1[i],dp1[i - a] + 1);
        }
        if(a % 2 == 0)continue;
        for(int i = a;i <= MAX;i++) {
            dp2[i] = min(dp2[i],dp2[i - a] + 1);
        }
    }

    while(true) {
        int n;
        cin >> n;
        if(n == 0)break;
        cout << dp1[n] << " " << dp2[n] << endl;
    }
    return 0;
}

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

const int m = 1000001;

int dp[2][1000001];

int main() {

    rep(i, 2)rep(j, m)dp[i][j] = j;

    for(int i=1,a;a=i*(i+1)*(i+2)/6,a<m;i++)
        rep(k, m-a) {
            if(dp[0][k]< dp[0][k+a])dp[0][k+a] = dp[0][k] + 1;
            if(a%2 && dp[1][k] < dp[1][k+a])dp[1][k+a] = dp[1][k] + 1;
        }

    for(int n;cin>>n,n;)cout<<dp[0][n]<<' '<<dp[1][n]<<endl;

    return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
#define MAX_N 1000000
#define MAX_P 190
typedef unsigned int uint;
int p[MAX_P];
int op[MAX_P];
char pn[MAX_N];
char opn[MAX_N];

int main()
{
	REP(i,MAX_P) p[i]=i*(i+1)*(i+2)/6;

	REP(i,MAX_P)for(int j=i;j<MAX_N;j++)
	{
		if((j*(j+1)*(j+2)/6)%2 ==1)
		{
			op[i]=j*(j+1)*(j+2)/6;
			break;
		}

	}
	REP(i,MAX_P) pn[i]=opn[i]=i;
	for(int i=2;i<MAX_N;i++)
	{
		if(p[i]>MAX_N) break;

		for(int j=p[i];j<MAX_N+1;j++)
		{
			pn[j] = min((uint)pn[j-p[i] ]+1,(uint)pn[j]);
			//cout <<(int) pn[j];
		}
		//cout << endl;
	}	

	for(int i=2;i<MAX_N;i++)
	{
		if(op[i]>MAX_N) break;

		for(int j=op[i];j<MAX_N+1;j++)
		{
			opn[j] = min((uint)(opn[j-op[i] ]+1),(uint)opn[j]);
		}
	}


	
	int n;
	while(cin >> n &&n)
	{
	




		cout << (uint)pn[n]  <<" " << (uint)opn[n] << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[190]={0},b[50]={0},c[1000001]={0,1,2,3},d[1000001]={0},k=0,i,j,n;
  for(i=1;i<190;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<189;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 1145141919
#define MOD 1000000007
#define ALL(a) begin((a)),end((a))
#define MS(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
struct edge
{
	int from, to, cost;
	bool operator < (const edge& e) const { return cost < e.cost; }
	bool operator >(const edge& e) const { return cost > e.cost; }
};
typedef vector<edge> edges;
///*************************************************************************************///
///*************************************************************************************///
///*************************************************************************************///
vi all, odd, v;
int allt[1000005], oddt[1000005];

int main()
{
	v.push_back(0);
	FOR(i, 1, 1000) v.push_back(v[i - 1] + i);
	all.push_back(0);
	FOR(i,1, v.size())
	{
		all.push_back(all[i - 1] + v[i]);
		if (i & 1) odd.push_back(all[i - 1] + v[i]);
		if (all[i] > 1000000) break;
	}
	int n;
	fill(ALL(allt), INF); fill(ALL(oddt), INF);
	REP(i, 1000001)REP(j, all.size())
	{
		int t = i + all[j];
		if (t >= 1000001) break;
		allt[t] = min(allt[i] + 1, allt[t]);
	}
	REP(i, 1000001)REP(j, odd.size())
	{
		int t = i + odd[j];
		if (t >= 1000001) break;
		oddt[t] = min(oddt[i] + 1, oddt[t]);
	}
	while (cin >> n, n) cout << allt[n] << " " << oddt[n] << endl;
	return 0;
}