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 <bits/stdc++.h>
using namespace std;

int func(int m, int p, vector<int> &q, int mi){
//	cout << m << " " << p << "\n";
	if(p == -1) return 0;
	int d = m / q[p];
	if(mi < d) return d;
	int np = upper_bound(q.begin(), q.end(), m-d*q[p])-1-q.begin();
	return d + func(m - d * q[p], np, q, mi);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	vector<int> a, b;
	for(int i=1; i*(i+1)*(i+2)/6<1e6; ++i){
		int t = i*(i+1)*(i+2)/6;
		a.push_back(t);
		if(t % 2 == 1) b.push_back(t);
	}
//	for(int i=0; i<a.size(); ++i)
//		cout << a[i] << "\n";
//	cout << a.size() << "\n";
//	cout << b.size() << "\n";
//	for(int i=0; i<b.size(); ++i)
//		cout << b[i] << "\n";
	while(1){
		int n;
		cin >> n;
		if(n == 0) return 0;
		int x = n, y = n;
		for(int i=a.size()-1; i>=0; --i){
			if(a[i] > n) continue;
			x = min(x, func(n, i, a, x));
		}
		for(int i=b.size()-1; i>=0; --i){
			if(b[i] > n) continue;
			y = min(y, func(n, i, b, y));
		}
		cout << x << " " << y << "\n";
	}
}

C++: #include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define MP make_pair
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define fst first
#define snd second

#define INF 1000000

int t(int x) { return x*(x+1)*(x+2)/6; }

int dp[1000010];

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  Vi one, two, odd;
  for (int i = 1; t(i) <= 1000000; i++) {
    one.push_back(t(i));
    if (t(i)%2) odd.push_back(t(i));
  }

  for (int a : one) {
    for (int b : one) {
      two.push_back(a+b);
    }
  }
  sort(ALL(two));

  REP(i, 1000001) dp[i] = INF;
  dp[0] = 0;
  REP(i, 1000000) {
    for (int a : odd) {
      if (i+1-a >= 0)
	dp[i+1] = min(dp[i+1-a]+1, dp[i+1]);
    }
  }  

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

    if (n == *lower_bound(ALL(one), n)) {
      cout << 1;
    } else if (n == *lower_bound(ALL(two), n)) {
      cout << 2;
    } else {
      bool flag = false;
      for (int a : one) {
	if (n - a == *lower_bound(ALL(two), n - a)) {
	  flag = true;
	  break;
	}
      }
      if (flag) {
	cout << 3;
      } else {
	for (int a : two) {
	  if (n - a == *lower_bound(ALL(two), n - a)) {
	    flag = true;
	    break;
	  }
	}
	cout << (flag ? 4 : 5);
      }
    }

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

  }    
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#define N 1000000

using namespace std;

int main(){
	vector<int> sq;
	vector<int> sqodd;
	int a[N];
	int aodd[N];
	for(int i = 1; i * (i + 1) * (i + 2) <= N; i++)  sq.push_back((i * (i + 1) * (i + 2)) / 6);
	for(int i = 1; i * (i + 1) * (i + 2) <= N; i++){
		if(((i * (i + 1) * (i + 2)) / 6) % 2) sqodd.push_back((i * (i + 1) * (i + 2)) / 6);
	}
	for(int i = 0; i < N; i++) a[i] = N;
	for(int i = 0; i < N; i++) aodd[i] = N;
	for(int i = 0; i < sq.size(); i++) a[sq[i]] = 1;
	for(int i = 0; i < sqodd.size(); i++) aodd[sqodd[i]] = 1;
	for(int i = 1; i < N; i++){
		if(a[i] == N) continue;
		for(int j = 0; j < sq.size(); j++){
			if(sq[j] + i < N && a[sq[j] + i] > a[i] + 1) a[sq[j] + i] = a[i] + 1;
		}
	}
	for(int i = 1; i < N; i++){
		if(aodd[i] == N) continue;
		for(int j = 0; j < sqodd.size(); j++){
			if(sqodd[j] + i < N && aodd[sqodd[j] + i] > aodd[i] + 1) aodd[sqodd[j] + i] = aodd[i] + 1;
		}
	}	
	int n;
	while(cin >> n, n) cout << a[n] << " " << aodd[n] << endl;

	return 0;
}

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);
	allt[0] = oddt[0] = 0;
	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;
}