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 <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>


using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }
#endif

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define clear(arr, val) memset(arr, val, sizeof(arr))

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

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

typedef long long ll;
typedef pair<int, int> pint;

const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };


const int MAX = 1000000;
int cal(int n) { return n*(n+1)*(n+2)/6; }
void dpru(int* res, const vector<int>& tet)
{
	static bool dp[MAX + 1];
	clear(dp, 0);
	dp[0] = true;
	for (int i = 1, num = 0; num < MAX; ++i)
	{
		for (int j = MAX; j >= 0; --j)
		{
			if (!dp[j])
			{
				for (int k = 0; !dp[j] && k < tet.size() && j - tet[k] >= 0; ++k)
					dp[j] = dp[j - tet[k]];
				if (dp[j])
				{
					res[j] = i;
					++num;
				}
			}
		}
	}
}
int main()
{
	vector<int> tetra, odd_tetra;
	for (int i = 1; cal(i) <= MAX; ++i)
	{
		tetra.push_back(cal(i));
		if (cal(i) & 1)
			odd_tetra.push_back(cal(i));
	}

	static int min_tet[MAX + 1], min_odd_tet[MAX + 1];
	dpru(min_tet, tetra);
	dpru(min_odd_tet, odd_tetra);

	int n;
	while (scanf("%d", &n), n)
		printf("%d %d\n", min_tet[n], min_odd_tet[n]);
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#define N 1000000
#define INFINITY 2000000000
using namespace std;
int dp[200][N],data[N];
vector<int> data2;
int DP(int);
int DP2(int);
int main(){
  int i,out,out2,n,c;
  data2.push_back(0);
  for(i=1;i<N;i++){
    data[i]=i*(i+1)*(i+2)/6;
    if(data[i]>N){
      c=i;
    }
    if(data[i]%2==1){
      data2.push_back(data[i]);
    }
  }
  while(1){
    cin >> n;
    if(n==0) break;
    out=DP(n);
    out2=DP2(n);
    cout << out << ' ' << out2 << endl;
  }
  return 0;
}
int DP(int n){
  int i,j,minret,s;
  for(i=1;i<N;i++){
    if(data[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}
int DP2(int n){
  int i,j,minret,s,len;
  len=data2.size();
  for(i=1;i<len;i++){
    if(data2[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data2[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data2[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}

C++: #include<iostream>
#define MAX 1000000
using namespace std;
int ans1[MAX+10],ans2[MAX+10],box[300];
void tab_make(){
	for(int i=1;;i++){
		box[i]=(i*(i+1)*(i+2)/6);
	if(i*(i+1)*(i+2)/6>MAX)
		break;
	}
}
void ans_make(){
	ans1[0]=ans2[0]=0;
	for(int i=1;i<=MAX;i++){
		ans1[i]=ans2[i]=i;
		for(int j=1;i-box[j]>=0;j++){
			ans1[i]=min(ans1[i],ans1[i-box[j]]+1);
			if(box[j]%2==1)
			ans2[i]=min(ans2[i],ans2[i-box[j]]+1);
		}
	}
}
int main(){
	int x;
	tab_make();
	ans_make();
	while(cin>>x,x){
		cout<<ans1[x]<<' '<<ans2[x]<<endl;
	}
	return 0;
}

C++: #include <stdio.h>
#include <stack>
#include <math.h>

using namespace std;

int main(){

	int n,table[200];
	int* dp = new int[1000000];
	int* odd_dp = new int[1000000];

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

	for(int i=0; i < 1000000; i++){
		odd_dp[i] = 20000000;
		dp[i] = 20000000;
	}

	dp[0] = 0;
	dp[1] = 1;

	for(int i = 2; i < 1000000; i++){
		for(int k = 1; k < 200; k++){
			if(table[k] <= i){
				dp[i] = (dp[i] <= dp[i-table[k]]+1)?dp[i]:dp[i-table[k]]+1;
			}else{
				break;
			}
		}
	}

	odd_dp[0] = 0;
	odd_dp[1] = 1;

	for(int i = 2; i < 1000000; i++){
		for(int k = 1; k < 200; k++){
			if(table[k] <= i && table[k]%2 == 1){
				odd_dp[i] = (odd_dp[i] <= odd_dp[i-table[k]]+1)?odd_dp[i]:odd_dp[i-table[k]]+1;
			}else if(table[k] > i)break;
		}
	}

	while(true){
		scanf("%d",&n);
		if(n == 0)break;

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

    return 0;
}