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 <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)

typedef long long ll;

#define N 1000000

int x[1000001]={} , y[1000001]={};

int main(void) {
    vector<int> a,b;
    int i=1;
    while (i*(i+1)*(i+2)/6<=N){
        int f = i*(i+1)*(i+2)/6;
        a.push_back(f);
        if (f%2==1)
            b.push_back(f);
        i++;
    }
    int n = a.size() , m = b.size();
    FOR(i,1,N){
        x[i] = N;
        y[i] = N;
    }
    FOR(i,0,N-1){
        REP(j,n){
            if (i+a[j]>N)
                break;
            x[i+a[j]] = min(x[i+a[j]],x[i]+1);
        }
        REP(j,m){
            if (i+b[j]>N)
                break;
            y[i+b[j]] = min(y[i+b[j]],y[i]+1);
        }
    }
    while (cin >> n && n){
        cout << x[n] << " " << y[n] << endl;
    }

    return 0;
}

C++: 
// Pollock's conjecture
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167&lang=jp 

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

const int MAX = 1000010;
int N;

vector<int> dp;
vector<int> odd_dp;

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

int main() { 
    while (cin >>  N) {
        if (N == 0) break;
        dp.assign(MAX, 0);
        odd_dp.assign(MAX, 0);
        dp[0] = 0;
        odd_dp[0] = 0;
        for (int n = 1; n <= N; ++n) {
            dp[n] = n;
            odd_dp[n] = n;
            for (int k = 1; t(k) <= n; ++k) {
                dp[n] = min(dp[n - t(k)] + 1, dp[n]); 
                if (t(k) % 2) {
                    odd_dp[n] = min(odd_dp[n - t(k)] + 1, odd_dp[n]); 
                }
            }
        }
        cout << dp[N] << " " << odd_dp[N] << endl;
    }
    return 0;
}

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

#define M_PI       3.14159265358979323846   // pi

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;

#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)

using namespace std;

static const ll INF = 1e15;


int main() {
    vector<ll> tri;    
    tri.reserve(1e6);
    tri.push_back(0);
    for (int i = 1; i < 1e6; i++) {
        auto next = tri.back() + i;
        if (next > 1e6) break;
        tri.push_back(next);
    }
    vector<ll> tetra;
    tetra.reserve(1e6);
    tetra.push_back(0);
    for (int i = 1; i < 1e6; i++) {
        auto t = tri[i];
        auto next = tetra.back() + t;
        if (next > 1e6) break;
        tetra.push_back(next);
    }
    vector<int> dp1(1e6 + 1);
    vector<int> dp2(1e6 + 1);
    for (int i = 0; i <= 1e6; i++) {
        dp1[i] = i;
        dp2[i] = i;
    }
    for (int i = 2; i <= 1e6; i++) {
        int u = dp1[i];
        for (int j = 1; j < tetra.size(); j++) {
            if (tetra[j] > i) break;
            u = min(u, dp1[i - tetra[j]] + 1);
        }
        dp1[i] = u;
    }
    for (int i = 2; i <= 1e6; i++) {
        int u = dp2[i];
        for (int j = 1; j < tetra.size(); j++) {
            if (tetra[j] > i) break;
            if (tetra[j] % 2 == 1) {
                u = min(u, dp2[i - tetra[j]] + 1);
            }
        }
        dp2[i] = u;
    }
    while (true) {
        int a;
        cin >> a;
        if (a == 0) return 0;
        cout << dp1[a] << " " << dp2[a] << endl;
    }
    return 0;
}