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 <algorithm>
#include <iostream>
using namespace std;
int dp[1000001],Odp[1000001];
int Tn[200],OTn[200]; 

int main(){
    int count = 0;  //pollocks numberの生成
    for(int i = 1;i < 200;i++){
        Tn[i-1] = i * (i + 1) * (i + 2) / 6;
        if(Tn[i-1] % 2 == 1){
            OTn[count] = Tn[i-1];
            count++;
        }
    }
    int n = 1000000;

    //正四面体数の個数の最小値
    for(int j = 0;j <= n;j++)
        dp[j] = j;
    int k;
    for(int i = 0;i < 200;i++)
        for(int j = Tn[i];j <= 1000000;j++){
            if(j >= Tn[i])
                dp[j] = min(dp[j],dp[j-Tn[i]] + 1);
            k = i;
        }

    //奇数正四面体数の個数の最小値
    for(int j = 0;j <= n;j++)
        Odp[j] = j;
    int k1;
    for(int i = 0;i <= 200;i++)
        for(int j = OTn[i];j <= n;j++){
            if(j >= OTn[i])
                Odp[j] = min(Odp[j],Odp[j-OTn[i]] + 1);
            k1 = i;
        }
    while(cin >> n,n)
        cout << dp[k][n] << ' ' <<  Odp[k1][n] << endl;


    return 0;
}

C++: #include<stdio.h>
#include<vector>
std::vector<int>t,o;
const int N=100000,V=1<<15;
int a[N],b[N];
int main()
{
	int i,j,n;
	for(i=1;i<N;++i)a[i]=b[i]=V;
	for(i=1;n=(i*(i+1)*(i+2))/6,n<N;++i)if(t.push_back(n),n&1)o.push_back(n);
	for(i=0;i<t.size();++i)
	{
		a[t[i]]=1;
		for(j=0;j+t[i]<N;++j)if(a[j]-V&&a[j]>5)break;else if(a[j]+1<a[j+t[i]])a[j+t[i]]=a[j]+1;
	}
	for(i=0;i<o.size();++i)
	{
		b[o[i]]=1;
		for(j=0;j+o[i]<N;++j)if(b[j]-V&&b[j]>37)break;else if(b[j]+1<b[j+o[i]])b[j+o[i]]=b[j]+1;
	}
	while(scanf("%d",&n),n)printf("%d %d\n",a[n],b[n]);
	return 0;
}

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

 int i,j,n,three[1000000],four[1000000],four_2[1000000],c[1000000],c_2[1000000];

int main(){
  
  three[0] = 1;
  four[0] = 1;
  for( i = 1; i < 1000000; i++ )three[i] = i+1 + three[i-1];
  for( i = 1; i < 1000000; i++ )four[i] = three[i] + four[i-1];
  
  int k = 0;
  for( i = 0; i < 1000000; i++ ){
    if(four[i] %2 == 1 ){
      four_2[k] = four[i];
      k++;
    }
  }
  
  while(1){
    int n; cin >> n;
    if(n==0)break;
    for( i = 0; i <= n; i++ ){
      c[i] = 2000000;
      c_2[i] = 2000000;
    }

    c[0] = 0;
    for( i = 0; i < 1000; i++ ){
      for( j = four[i]; j <= n; j++ ){
	c[j] = min( c[j],c[j-four[i]] + 1 );
      }
    }

    c_2[0] = 0;
    for( i = 0; i < 1000; i++ ){
      for ( j = four_2[i]; j <= n; j++ ){
	c_2[j] = min( c_2[j],c_2[j-four_2[i]] + 1 );
      }
    }
    cout << c[n] << " " << c_2[n] << endl;
  }
    return 0;
}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const int N = 1000000;
const int mod = 1000000007;
const int INF = 1 << 30;
#define rep(i,n) for(int i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define fix(n) fixed<<setprecision(n)
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll ss[1000];//正四面体数
vector<ll>v;
ll dp[1000000],dp2[1000000];
int main() {
	v.pb(1);
	ll n,now=1;
	rep(i, 1000) {
		ss[i] = (ll)i*(i + 1)*(i + 2) / 6;
		if (ss[i] % 2 == 1)v.pb(ss[i]);
	}
	rep(i, 100000) {
		if (i < 2) { dp[i] = i; continue; }
		if (i >= ss[now + 1])++now;
		dp[i] = i / ss[now] + dp[i%ss[now]];
		for (int j = now - 1; j >= 1; --j)dp[i] = min(dp[i], i / ss[j] + dp[i%ss[j]]);
	}
	now = 1;
	rep(i, 100000) {
		if (i < 2) { dp2[i] = i; continue; }
		if (i >= v[now + 1])++now;
		dp2[i] = i / v[now] + dp2[i%v[now]];	
		for (int j = now - 1; j >= 1; --j)dp2[i] = min(dp2[i], i / v[j] + dp2[i%v[j]]);
	
	}
	while (cin >> n, n) {
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}

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

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }
    ////
    int dp[10000];
    /*/fill(dp,dp + x+1,100000);
  

    dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count;j++){
	if(i+coin[j]<=x){
	  dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	}
      }
    }

    cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	}
      }
    }
   */
    cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}