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]);
			if (minnum == 2)
				break;
		}
		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]);
			if (minnum == 2)
				break;
		}
		return minnum;
	}
}

C++: ///
// File:  1167.cpp
// Author: ymiyamoto
//
// Created on Sat Dec  2 18:27:58 2017
//

#include <algorithm>
#include <array>
#include <cstdint>
#include <iostream>
#include <vector>

using namespace std;

uint32_t polloc(uint32_t n)
{
  return n * (n + 1) * (n + 2) / 6;
}

static array<int32_t, 1000001> dp;
static array<int32_t, 1000001> odddp;

int32_t main()
{
  for (uint32_t i = 0; i < dp.size(); i++) {
    dp[i] = odddp[i] = i;
  }

  vector<int64_t> pollocs;
  for (uint32_t i = 0; i <= 181; i++) {
    pollocs.push_back(polloc(i));
  }

  for (int64_t i = 0; i < (int64_t)dp.size(); i++) {
    for (int64_t j = 0; j < (int64_t)pollocs.size(); j++) {
      if (i - pollocs[j] >= 0) {
        dp[i] = min(dp[i], dp[i - pollocs[j]] + 1);
        if (pollocs[j] % 2 == 1) {
          odddp[i] = min(odddp[i], odddp[i - pollocs[j]] + 1);
        }
      }
    }
  }

  while (true) {
    uint32_t n;
    cin >> n;
    if (n == 0) break;
    cout << dp[n] << " " << odddp[n] << endl;
  }

  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

int tetrahedron(int);

int index_direct_match(int);
int index_direct_match_odd(int);
int index_number(int);
int index_number_odd(int);

int main(int argc, char const *argv[]) {

  int n;
  int cnt_min;
  int cnt_only_odd;

  for(cin >> n;n != 0;cin >> n){

    cout << index_number(n) << " " <<  index_number_odd(n) << endl;

  }

  //

  return 0;
}

int tetrahedron(int k){

  return k*(k+1)*(k+2)/6;

}

int index_number(int index){
  static int memo[1000]={};
  if(index>=1 && index<=3) return index;
  else if(index_direct_match(index)) return 1;
  else if(memo[index] != 0) return memo[index];
  else{
    vector<int> comp_array;
    for(int i=1;index > tetrahedron(i);i++){
      //cout << "index:" << index << endl;
      //cout << "tetra:" << tetrahedron(i) << endl;
      comp_array.push_back(1+index_number( index - tetrahedron(i) ));
    }
    memo[index]=(int)*min_element(comp_array.begin(),comp_array.end());
    return *min_element(comp_array.begin(),comp_array.end());
  }

}

int index_direct_match(int index){

  for(int i=1;i<200;i++){
    if(index == tetrahedron(i)){
      return 1;
    }
  }
  return 0;
}

int index_direct_match_odd(int index){

  for(int i=1;i<200;i+=4){
    if(index == tetrahedron(i)){
      return 1;
    }
  }
  return 0;
}

int index_number_odd(int index){
  static int memo2[1000]={};
  if(index>=1 && index<=34) return index;
  else if(index_direct_match_odd(index)) return 1;
  else if(memo2[index] != 0) return memo2[index];
  else{
    vector<int> comp_array;
    for(int i=1;index > tetrahedron(i);i+=4){
      //cout << "index:" << index << endl;
      //cout << "tetra:" << tetrahedron(i) << endl;
      comp_array.push_back(1+index_number_odd( index - tetrahedron(i) ));
    }
    memo2[index]=(int)*min_element(comp_array.begin(),comp_array.end());
    return *min_element(comp_array.begin(),comp_array.end());
  }
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;

const int MAX_N = 100100;
const int INF = 1 << 29;

void solve(int n)
{
	int dp[MAX_N], dp_odd[MAX_N];
	fill_n(dp, n + 1, INF);
	fill_n(dp_odd, n + 1, INF);
	
	dp[0] = 0;
	dp_odd[0] = 0;
	REP(i, 100) {
		int m = (i + 1) * (i + 2) * (i + 3) / 6;
		if(m > n) break;
		FOR(j, m, n + 1) {
			if(m % 2) dp_odd[j] = min(dp_odd[j], dp_odd[j - m] + 1);
			dp[j] = min(dp[j], dp[j - m] + 1);
		}
	}
	
	printf("%d %d\n", dp[n], dp_odd[n]);
}

int main()
{
	int n;
	
	while (scanf("%d", &n), n) solve(n);
	return 0;
}