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>

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 <bits/stdc++.h>
using namespace std;

int n;
vector<int> vec, vec2;
int dp[1000005], dp2[1000005];

int main(void)
{
    for(long long x, i = 1; (x = i*(i+1)*(i+2)/6, x) <= 1000000; i++){
        if(x % 2) vec2.push_back(x);
        vec.push_back(x);
    }
    
    for(int i = 0; i <= 1000000; i++) dp[i] = dp2[i] = 1e9;
    dp[0] = dp2[0] = 0;
    for(int i = 0; i < 1000000; i++){
        for(int j = 0; j < vec.size(); j++){
            if(i+vec[j] <= 1000000) dp[i+vec[j]] = min(dp[i+vec[j]], dp[i]+1);
        }
        for(int j = 0; j < vec2.size(); j++){
            if(i+vec2[j] <= 1000000) dp2[i+vec2[j]] = min(dp2[i+vec2[j]], dp2[i]+1);
        }
    }
    
    while(cin >> n, n){
        cout << dp[n] << " " << dp2[n] << endl;
    }
    return 0;
}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const int N = 1000000;
const int mod = 1000000007;
const int INF = 1 << 30;
#define rep(i,n) for(int i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define fix(n) fixed<<setprecision(n)
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll ss[1000];//正四面体数
vector<ll>v;
ll dp[1000000],dp2[1000000];
int main() {
	v.pb(1);
	ll n,now=1;
	rep(i, 1000) {
		ss[i] = (ll)i*(i + 1)*(i + 2) / 6;
		if (ss[i] % 2 == 1)v.pb(ss[i]);
	}
	rep(i, 100000) {
		if (i < 2) { dp[i] = i; continue; }
		if (i >= ss[now + 1])++now;
		dp[i] = i / ss[now] + dp[i%ss[now]];
		for (int j = now - 1; j >= 1; --j)dp[i] = min(dp[i], i / ss[j] + dp[i%ss[j]]);
	}
	now = 1;
	rep(i, 100000) {
		if (i < 2) { dp2[i] = i; continue; }
		if (i >= v[now + 1])++now;
		dp2[i] = i / v[now] + dp2[i%v[now]];	
		for (int j = now - 1; j >= 1; --j)dp2[i] = min(dp2[i], i / v[j] + dp2[i%v[j]]);
	
	}
	while (cin >> n, n) {
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}