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

int n;
int memo1[1000001], memo2[1000001], memoodd[1000001], memo3[1000001];

int pollock_1(int n)
{
    int min = 100, ex;
    if (n == memo1[n])
        return memo2[n] = 1;
    if (memo2[n] > 0)
        return memo2[n];
    for (int i = 1; i < 1000001; i++)
    {
        if (i <= n / 2)
        {
            if (pollock_1(n - i) == 1)
            {
                ex = pollock_1(n - i) + pollock_1(i);
            }
            if (i == 1)
            {
                ex = pollock_1(n - 1) + 1;
            }
            if (ex < min)
                min = ex;
        }
    }
    return memo2[n] = min;
}

int pollock_2(int n)
{
    int min = 10000000, ex;
    if (n == memoodd[n])
        return memo2[n] = 1;
    if (memo3[n] > 0)
        return memo3[n];
    for (int i = 1; i < 1000001; i++)
    {
        if (i <= n / 2)
        {
            if (pollock_2(n - i) == 1)
            {
                ex = pollock_2(n - i) + pollock_2(i);
            }
            if (i == 1)
            {
                ex = pollock_2(n - 1) + 1;
            }
            if (ex < min)
                min = ex;
        }
    }
    return memo3[n] = min;
}

int main()
{
    for (int k = 0; k < 1000001; k++)
    {
        memo1[k] = 0;
        memo2[k] = 0;
        memoodd[k] = 0;
        memo3[k] = 0;
    }
    for (int k = 1; k < 200; k++)
    {
        n = (k * (k + 1) * (k + 2)) / 6;
        memo1[n] = n;
        if (n % 2 != 0)
            memoodd[n] = n;
    }
    while (1)
    {
        scanf("%d", &n);
        if (n == 0)
            break;
        printf("%d %d\n", pollock_1(n), pollock_2(n));
    }
}

C++: #include <stdio.h>
#include <string.h>
#define INF 1000001

int main(void){
	int i, j, n ,c, small1, small2;
	int dp1[1000000],dp2[1000000];
	scanf("%d",&n);
	while(n != 0){
		for(i = 0;i <= n;i++)
			dp1[i] = dp2[i] = INF;
		dp1[0] = dp2[0] = 0;
		for(i = 0;i < n;i++){
			small1 = dp1[n];
			for(j = i;j < n && dp1[j] >= small1;j++);
			if(j == n)
				break;
			if(j != i)
				i = j - 1;
			if(dp1[i] != INF){
				for(j = 1,c = j * (j + 1) * (j + 2);c / 6 + i <= n;j++,c = j * (j + 1) * (j + 2)){
					if(dp1[c / 6 + i] > dp1[i] + 1 && dp1[i] != INF)
						dp1[c / 6 + i] = dp1[i] + 1;
				}
			}
		}
		for(i = 0;i < n;i++){
			small2 = dp2[n];
			for(j = i;j < n && dp2[j] >= small2;j++);
			if(j == n)
				break;
			if(j != i)
				i = j - 1;
			if(dp2[i] != INF){
				for(j = 1,c = j * (j + 1) * (j + 2);c / 6 + i <= n;j++,c = j * (j + 1) * (j + 2)){
					if(dp2[c / 6 + i] > dp2[i] + 1 && (c / 6) % 2 == 1 && dp2[i] != INF)
						dp2[c / 6 + i] = dp2[i] + 1;
				}
			}
		}
		printf("%d %d\n",dp1[n],dp2[n]);
		scanf("%d",&n);
	}
	return 0;
}

C++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

int main() {
    vi four;
    int n = 1;
    while(true) {
        int num = n*(n+1)*(n+2)/6;
        if(num > 1000000) {
            break; 
        } else {
            four.push_back(num);
            n++;
        }
    }
    int fsize = four.size();

    vi dp(1000000+1, INF);
    vi dpk(1000000+1, INF);
    dp[0] = dpk[0] = 0;
 
    FOR(i, 1, 1000000) {
        REP(j, fsize) {
            if(i-four[j] >= 0) {
                dp[i] = min(dp[i-four[j]]+1, dp[i]);
                if(four[j]%2) {
                    dpk[i] = min(dpk[i-four[j]]+1, dpk[i]);
                }
            } else {
                break;
            }
        }
    }

    while(cin >> n, n) {
        cout << dp[n] << " " << dpk[n] << endl;
    }
 
    return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;

int dp[1000001];
int dp2[1000001];

int func(int v){
	if(dp[v]!=11451419)return dp[v];
	if(v==0)return 0;
	int cnt=11451419;
	for(int i=1;i*(i+1)*(i+2)/6<=1000000;i++){
		if(v-i*(i+1)*(i+2)/6>=0)cnt=min(cnt,func(v-i*(i+1)*(i+2)/6));
	}
	return (dp[v]=cnt+1);
}

int func2(int v){
	if(dp2[v]!=11451419)return dp2[v];
	if(v==0)return 0;
	int cnt=11451419;
	for(int i=1;i*(i+1)*(i+2)/6<=1000000;i++){
		if(i*(i+1)*(i+2)/6%2!=1)continue;
		if(v-i*(i+1)*(i+2)/6>=0)cnt=min(cnt,func2(v-i*(i+1)*(i+2)/6));
	}
	return dp2[v]=cnt+1;
}

int main(void){
	int n;
	for(int i=1;i<=1000000;i++)dp[i]=dp2[i]=11451419;
	while(1){
		scanf("%d",&n);
		if(n==0)break;
		printf("%d %d\n",func(n),func2(n));
	}
	return 0;
}