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 <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#define DEBUG_ //!!提出時にコメントアウト!!
#ifdef DEBUG_
	#define dump(x)  cerr << #x << " = " << (x) << endl;
#else
	#define dump(x)  ;
#endif

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back

//#define int long long

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

template <typename T>
std::string printVector(const std::vector<T> &data)
{
    std::stringstream ss;
    std::ostream_iterator<T> out_it(ss, ", ");
    ss << "[";
    std::copy(data.begin(), data.end() - 1, out_it);
    ss << data.back() << "]";
    return ss.str();
}

const int MOD = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;

int dp[1123456] = {};
int dp2[1123456] = {};

signed main(int argc, char const *argv[])
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    REP(i,1123456) {
        dp[i] = INF;
        dp2[i] = INF;
    }
    dp[0] = 0;
    dp2[0] = 0;
    VL tetra;
    VL oddtetra;
    int cnt = 1;
    while(1){
        LL tmp = cnt * (cnt+1) * (cnt+2) / 6;
        if(tmp <= 1e6){
            tetra.eb(tmp);
            if(tmp % 2 == 1) oddtetra.eb(tmp);
            cnt++;
        }
        else{
            break;
        }
    }
    //dump(cnt)
    //cout << printVector(tetra) << endl;

    for(int p : tetra){
        FOR(i,p,1000456){
            dp[i] = min(dp[i-p]+1, dp[i]);
        }
    }
    for(int p : oddtetra){
        FOR(i,p,1000456){
            dp2[i] = min(dp2[i-p]+1, dp2[i]);
        }
    }

    //REP(i,50){
    //    cout << i << ":" << dp2[i] << endl;
    //}
    while(1){
        int x; cin >> x;
        if(x == 0) break;

        cout << dp[x] << " " << dp2[x] << endl;
    }


}

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

#define NUM 1000*1000

using namespace std;

int pnum[500], dp1[NUM], dp2[NUM];

int main(){
	for(int i=0; pnum[i-1]<NUM; i++){
		pnum[i] = (i*(i+1)*(i+2))/6;
	}
	for(int i=1; i<NUM; i++){
		dp1[i]=dp2[i]=NUM+1;
	}
	for(int i=0; i<NUM; i++){
		for(int j=0; j<500; j++){
			if(i+pnum[j]>NUM) break;
			dp1[i+pnum[j]] = min(dp1[i+pnum[j]], dp1[i]+1);
			if(pnum[j]%2) dp2[i+pnum[j]] = min(dp2[i+pnum[j]], dp2[i]+1);
		}
	}
	while(1){
		int n;  cin >>n;
		if(!n) break;
		cout << dp1[n] << " " << dp2[n] << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    const int INF = 1 << 30;
    vector<int> dp1(1000000, INF), dp2(1000000, INF);
    dp1[0] = dp2[0] = 0;
    for (int i = 0; i < 1000000; ++i) {
        for (int j = 1; ; ++j) {
            int num = j * (j + 1) * (j + 2) / 6;
            if (i + num >= 1000000) break;
            dp1[i + num] = min(dp1[i + num], dp1[i] + 1);
            if (num % 2 == 1) dp2[i + num] = min(dp2[i + num], dp2[i] + 1);
        }
    }
    int n;
    while (cin >> n, n) {
        cout << dp1[n] << " " << dp2[n] << endl;
    }
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }
    ////
    int dp[100000];
    //fill(dp,dp + x+1,100000);
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count-1;j++){
	if(i+coin[j]<=x){
	  //dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	  tmp=min(dp[i+coin[j]],dp[i]+1);
	  dp[i+coin[j]]=tmp;
	}
      }
    }

    cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1); 
	  tmp=min(dp[i+coin_ki[j]],dp[i]+1);
	  dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}