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>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<sstream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
#include<climits>
using namespace std;
#define rep(i, j) for(int i = 0; i < j; i++)
#define f(i, k, j) for(int i = k; i < j; i++)
#define P pair<int, int>
const int INF = 1000010;

int n, dp[INF], dp2[INF];
vector<int> c, ctmp;

void solve(){
    for(int i = 2; ; i++){
        int tmp = (i * (i + 1) * (i + 2)) / 6;
        if(tmp >= INF) break;
        else{
            c.push_back(tmp);
            if(tmp % 2 == 1) ctmp.push_back(tmp);
        }
    }
    rep(i, INF){
        dp[i] = i;
        dp2[i] = i;
    }

    rep(i, c.size()){
        for(int j = c[i]; j < INF; j++){
            dp[j] = min(dp[j], dp[j - c[i]] + 1);
        }
    }
    rep(i, ctmp.size()){
        for(int j = ctmp[i]; j < INF; j++){
            dp2[j] = min(dp2[j], dp2[j - ctmp[i]] + 1);
        }
    }
}

int main(){
    solve();
    while(cin >>n && n){
        cout <<dp[n] <<" " <<dp2[n] <<endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int i;
    int n;
    int j = 0;
    int a[84];
    int b[22];
    int t1[1000010],t2[1000010];
    for(i = 0; i < 83; i++){
        a[i] = (i+1)*(i+2)*(i+3)/6;
        if(a[i] % 2 == 1){
            b[j] = a[i];
            j++;
        }
    }
    //cout << a[82] << b[20] << endl;
    /*for(i = 0; i < 83; i++){
        cout << "a[i] = " << a[i] << endl;
    }
    for(i = 0; i < 21; i++){
        cout << "b[i] = " << b[i] << endl;
    }*/

        for(i = 0; i <= 100005; i++){
            t1[i] = i;
        }

        for(i = 0; i <= 82; i++){
            for(j = a[i]; j <= 100005; j++){
                if(t1[j] > t1[j - a[i]] + 1){
                    t1[j] = t1[j -a[i]] + 1;
                }
            }    
        }        

        for(i = 0; i <= 100005; i++){
            t2[i] = i;
        }
        
        for(i = 0; i <= 20; i++){
            for(j = b[i]; j <= 100005; j++){
                if(t2[j] > t2[j - b[i]] + 1){
                    t2[j] = t2[j - b[i]] + 1;
                }
            }
        }
            


    while(1){
        cin >> n;
        if(n == 0){
            break;
        }
        cout << t1[n] << " " << t2[n] << endl;
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int tsum[1000060];
int toddsum[1000060];

int main()
{
  int n;
  cin >> n;
  int last = 1;
  tsum[1] = 1;
  toddsum[1] = 1;

  while (n > 0)
    {
      for (;last < n+1; last++)
	{
	  for (int i = 1; i*(i+1)*(i+2)/6 < last+1; i++)
	    {
	      int tet = i*(i+1)*(i+2)/6;
	      if (last - tet >= 0 && 
		  (tsum[last] == 0 || tsum[last-tet] + 1 < tsum[last]))
		tsum[last] = tsum[last-tet]+1;
	      if ((tet % 2 == 1) &&
		  last - tet >= 0 &&
		  (toddsum[last] == 0 || 
		  toddsum[last-tet] + 1 < toddsum[last]))
		toddsum[last] = toddsum[last-tet]+1;
	    }
	}
      cout << tsum[n] << " " << toddsum[n] << "\n";
      cin >> n;
    }

  
}

C++: #include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define pb            push_back
template<class T, class S> inline pair<T, S> mp(T x, S y){ return make_pair(x, y); }
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }

static const int    INF = 1000000000;
static const ll     MOD = 1000000007LL;
static const double EPS = 1E-12;

const int MAX_N = 1000011;
int dp1[MAX_N+2];
int dp2[MAX_N+2];
vi w1;
vi w2;
int N;

inline int get(int i){ return i * (i + 1) / 2 * (i + 2) / 3; }

int main()
{
  rrep(i, 1, MAX_N){
    if(get(i) >= MAX_N) break;
    w1.pb(get(i));
    if(get(i) & 1) w2.pb(get(i));
  }
  int n1 = w1.size();
  int n2 = w2.size();

  rep(i, MAX_N) dp1[i] = dp2[i] = INF;
  rep(i, n1) dp1[w1[i]] = 1;
  rep(i, n2) dp2[w2[i]] = 1;
  rrep(i, 1, 111) rep(j, n1) if(i + w1[j] < MAX_N) minup(dp1[i + w1[j]], dp1[i] + 1);
  rrep(i, 1, 111) rep(j, n2) if(i + w2[j] < MAX_N) minup(dp2[i + w2[j]], dp2[i] + 1);

  while(cin >> N, N) cout << dp1[N] << ' ' << dp2[N] << endl;

  return 0;
}