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>
#include <algorithm>
using namespace std;

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

const int MAX = 1000000;

int dp[MAX + 1];
int dp2[MAX + 1];

int tetra(int n)
{
  return n * (n + 1) * (n + 2) / 6;
}

void solve(int n)
{
  for(int i = 1; tetra(i) <= n; i++){
    if(tetra(i) & 1)
      dp2[tetra(i)] = 1;
    dp[tetra(i)] = 1;
  }
  for(int i = 1; i <= n; i++){
    for(int j = 1; j <= n; j++){
      if(dp[j] == i){
        for(int k = 1; j + tetra(k) <= n; k++){
          dp[j + tetra(k)] = min(i + 1, dp[j + tetra(k)]);
        }
      }
    }
  }
  for(int i = 1; i <= n; i++){
    for(int j = 1; j <= n; j++){
      if(dp2[j] == i){
        for(int k = 1; j + tetra(k) <= n; k++){
          if(tetra(k) & 1)
            dp2[j + tetra(k)] = min(i + 1, dp2[j + tetra(k)]);
        }
      }
    }
  }
}


    
int main()
{
  int n;
  while(1){
    cin >> n;
    if(n == 0){
      break;
    }else{
      fill(dp, dp + n + 1, MAX);
      fill(dp2, dp2 + n + 1, MAX);
      solve(n);
      cout << dp[n] << " " << dp2[n] << endl;
    }
  }
}

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

typedef long long int number;

const number NMAX = 1e6 + 8;

int dp[NMAX], odp[NMAX];

int main() {
  REP(i, NMAX) {
    dp[i] = odp[i] = i;
  }
  for (number i = 2; i * (i + 1) * (i + 2) / 6 < NMAX; i++) {
    int tetr = i * (i + 1) * (i + 2) / 6;
    int limit = min(NMAX, (i + 1) * (i + 2) * (i + 3) / 6 + 8);
    for (number j = tetr; j < limit; j++) {
      dp[j] = min(dp[j], dp[j - tetr] + 1);
    }

    if (tetr % 2 != 0) {
      int limit = min(NMAX, (i + 4) * (i + 5) * (i + 6) / 6 + 8);
      for (number j = tetr; j < limit; j++) {
        odp[j] = min(odp[j], odp[j -tetr] + 1);
      }
    }
  }

  int n;
  while (cin >> n and n) {
    cout << dp[n] << " " << odp[n] << endl;
  }
}

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

int func(int n)
{
  return n * (n + 1) * (n + 2) / 6;
}

int solve1(int n, int j)
{
  int c = 0, m = 1000000;
  for(int i = j; n >= 0; i--){
    while(n >= func(i)){
      c++;
      n -= func(i);
    }
    if(n == 0)
      break;
  }
  m = min(m, c);
  return m;
}

int solve2(int n, int j)
{
  int c = 0, m = 1000000;
  for(int i = j; n >= 0; i--){
    while(n >= func(i) && (func(i) & 1)){
      c++;
      n -= func(i);
    }
    if(n == 0)
      break;
  }
  m = min(m, c);
  return m;
} 

int main()
{
  int n;
  while(1){
    cin >> n;
    if(n == 0){
      break;
    }else{
      int m1, m2;
      m1 = m2 = 1000000;
      int k = 1;
      while(n >= func(k)) 
	k++;
      for(int i = k - 1; i >= 1; i--){
	m1 = min(m1, solve1(n, i));
	m2 = min(m2, solve2(n, i));
      }
      cout << m1 << " " << m2 << endl;
    }
  }
}

C++: #include<iostream>
#include<vector>
#include<utility>
using namespace std;
int main(int argc, char *argv[])
{
  const int N = 1000001;
  vector<int> full(N);
  vector<int> odd(N);
  for(int i = 0; i < N; i++) full[i] = i;
  for(int i = 0; i < N; i++) odd[i] = i;
  for(int n = 2; ; n++) {
    const int t = (n * (n+1) * (n+2))/6;
    if(t >= N) break;
    for(int i = 0; i + t < N; i++) {
      const int k = i + t;
      if(full[i] + 1 < full[k]) full[k] = full[i] + 1;
      if(t & 1) {
        if(odd[i] + 1 < odd[k]) odd[k] = odd[i] + 1;
      }
    }
  }
  
  for(int t = 1;; t++) {
    int n;
    cin >> n;
    if(n == 0) break;
    cout << full[n] << " " << odd[n] << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for(ll i = a; i < b; ++i)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int qx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int qy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

vector<ll> p;
vector<ll> o;
vector<ll> memo(1000001, INF);

ll cal(ll n) {
	if(memo[n] != INF) return memo[n];
	else {
		ll ans = INF;
		ll i = 0;
		while(i < o.size() && o[i] < n) {
			ans = min(ans, 1 + cal(n - o[i]));
			++i;
		}
		return memo[n] = ans;
	}
}

int main(void) {

	for(ll i = 0; i * (i + 1) * (i + 2) / 6 <= 1000000; ++i) {
		p.pb(i * (i + 1) * (i + 2) / 6);
		if((i * (i + 1) * (i + 2) / 6) % 2 == 1) o.pb(i * (i + 1) * (i + 2) / 6);
	}
	vector<P> nf;
	map<ll, ll> nb;
	REP(i, p.size()) {
		REP(j, p.size()) {
			if(p[i] + p[j] > 1000000) continue;
			nf.pb(P(p[i] + p[j], (ll)(p[i] != 0) + (ll)(p[j] != 0)));
			REP(k, p.size()) {
				if(nb.count(p[i] + p[j] + p[k]) != 0)
				nb[p[i] + p[j] + p[k]] = min(nb[p[i] + p[j] + p[k]], (ll)(p[i] != 0) + (ll)(p[j] != 0) + (ll)(p[k] != 0));
				else
				nb[p[i] + p[j] + p[k]] = (ll)(p[i] != 0) + (ll)(p[j] != 0) + (ll)(p[k] != 0);
			}
		}
	}
	memo[0] = 0;
	REP(i, o.size()) {
		memo[o[i]] = 1;
	}
	while(true) {
		ll n;
		cin>>n;
		if(n == 0) break;
		ll ans1 = INF, ans2 = INF;
		REP(i, nf.size()) {
			if(nb.count(n - nf[i].first) != 0) {
				ans1 = min(ans1, nf[i].second + nb[n - nf[i].first]);
			}
		}
		ans2 = cal(n);
		cout<<ans1<<" "<<ans2<<endl;
	}
}