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 <set>
#define MAXNUM 10000
using namespace std;

int all[MAXNUM], odd[MAXNUM];
set<int> allfour, oddfour;
int max(int a, int b);
int min(int a, int b);
int getall(int n);
int getodd(int n);

int main()
{
	int n;
	int counter = 0;

	//1からMAXまでの中に存在する正四面体数をsetに入れる．
	int now = 0, four;
	while (1){
		now++;
		four = now  *(now + 1)*(now + 2) / 6;
		if (four>MAXNUM)
			break;
		allfour.insert(four);
		if (four % 2 == 1)
			oddfour.insert(four);
	}

	//1からMAXNUMまで，配列を埋める.
	for (int i = 1; i <= MAXNUM; i++){
		all[i] = getall(i);
		odd[i] = getodd(i);
	}

	//入力
	while (cin >> n, n)
		cout << all[n] << " " << odd[n] << endl;

	return 0;

}




int max(int a, int b){
	if (a > b)
		return a;
	else
		return b;
}

int min(int a, int b){
	if (a > b)
		return b;
	else
		return a;
}

int getall(int n){
	set<int>::iterator it = allfour.find(n);
	if (it != allfour.end())
		return 1;
	else{
		int minnum = 1000;
		for (int i = 1; i < n / 2 + 1; i++){
			minnum = min(minnum, all[i] + all[n - i]);
		}
		return minnum;
	}
}

int getodd(int n){
	set<int>::iterator it = oddfour.find(n);
	if (it != oddfour.end())
		return 1;
	else{
		int minnum = 1000;
		for (int i = 1; i < n / 2 + 1; i++){
			minnum = min(minnum, odd[i] + odd[n - i]);
		}
		return minnum;
	}
}

C++: #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define pb(a) push_back(a)

using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

int main() {
    int n;
    int a[1000];
    int b[1000];
    int dp1[1000000];
    int dp2[1000000];
    while(cin >> n) {
        if(n == 0) break;
        rep(i,0,1000) {
            a[i] = 0;
            b[i] = 0;
        }

        int cnt = 0;
        for(int i = 1; i * (i+1) * (i+2) / 6 <= n; i++) {
            int t = i * (i+1) * (i+2) / 6;
            a[i-1] = t;

            if(t % 2 == 1) {
                b[cnt] = t;
                cnt++;
            }
        }

/*
        for(int i = 1; i * (i+1) * (i+2) / 6 <= n; i++) {
            cout << a[i-1] << endl;
        }

        cout << endl;

        for(int i = 0; b[i] != 0; i++) {
            cout << b[i] << endl;
        }
*/

        rep(i,0,1000000) {
            dp1[i] = i;
            dp2[i] = i;
        }

        int k = 0;
        while(1) {
            if(a[k] != 0 || b[k] != 0) {
                rep(j,0,n+1) {
                    dp1[j+a[k]] = min(dp1[j+a[k]], dp1[j] + 1);
                    dp2[j+b[k]] = min(dp2[j+b[k]], dp2[j] + 1);
                }
            }
            else break;
            k++;
        }

        cout << dp1[n] << " "<< dp2[n] << endl;
    }
    return 0;
}

C++: //
//  main.cpp
//  AOJ1167
//
//  Created by aki33524 on 2014/07/09.
//  Copyright (c) 2014年 aki33524. All rights reserved.
//

#include <iostream>
#include <vector>
using namespace std;

const int MAX_N = 1000000;
const int MAX_T = 200;

vector<int> tetras;
vector<int> oddtetras;
int dp1[MAX_T + 1][MAX_N];
int dp2[MAX_T + 1][MAX_N];

void init(){
    memset(dp1, 0x3f, sizeof(dp1));
    memset(dp2, 0x3f, sizeof(dp2));
    
    for(int i=0; i<MAX_T; i++){
        int t = i*(i+1)*(i+2)/6;
        tetras.push_back(t);
        if(t%2)
            oddtetras.push_back(t);
    }
    
    for(int i=0; i<tetras.size(); i++)
        dp1[0][tetras[i]] = 1;
    for(int i=0; i<tetras.size(); i++){
        int t = tetras[i];
        for(int j=0; j<MAX_N; j++){
            if(j < t){
                dp1[i+1][j] = dp1[i][j];
            }else{
                dp1[i+1][j] = min(dp1[i][j], dp1[i+1][j-t]+1);
            }
        }
    }
    
    for(int i=0; i<oddtetras.size(); i++)
        dp2[0][oddtetras[i]] = 1;
    for(int i=0; i<oddtetras.size(); i++){
        int t = oddtetras[i];
        for(int j=0; j<MAX_N; j++){
            if(j < t){
                dp2[i+1][j] = dp2[i][j];
            }else{
                dp2[i+1][j] = min(dp2[i][j], dp2[i+1][j-t]+1);
            }
        }
    }
}

int main(int argc, const char * argv[])
{
    init();
    
    int N;
    while(cin>>N, N){
        cout << dp1[tetras.size()][N] << " " << dp2[oddtetras.size()][N] << endl;;
    }
    
    return 0;
}

C++: /*
Pollocks conjecture
https://onlinejudge.u-aizu.ac.jp/problems/1167
*/

#include <iostream>
#include <vector>
using namespace std;

const int MAX = 1000100;
const int INF = 1<<29;

int main() {
    vector<int> dp_all(MAX, INF), dp_odd(MAX, INF);
    dp_all[0] = dp_odd[0] = 0;
    for (int i = 1;; ++i) {
        int num = i * (i+1) * (i+2) / 6;
        if (num >= MAX) break;
        for (int j = num; j < MAX; ++j) {
            dp_all[j] = min(dp_all[j], dp_all[j-num]+1);
            if (num & 1) dp_odd[j] = min(dp_odd[j], dp_odd[j-num]+1);
        }
    }

    //for(int i=0; i<MAX; i++) cout << dp_all[i] << " " << dp_odd[i] << endl;
    int n;
    while (cin >> n, n!=0) {
        cout << dp_all[n] << " " << dp_odd[n] << endl;
    }
}