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>

using namespace std;
#define MAX 1000000
#define INF 1000000000

int dp1[MAX + 1], dp2[MAX + 1];

int main()
{
    for (int i = 1; i < MAX; i++)
    {
        dp1[i] = INF;
        dp1[i] = INF;
    }
    for (int n = 1; n * (n + 1) * (n + 2) <= MAX; n++)
    {
        int a = n * (n + 1) * (n + 2);
        for (int i = a; i < MAX; i++)
        {
            dp1[i] = min(dp1[i], dp1[i - a] + 1);
        }
        if (a % 2 == 0)
            continue;
        for (int i = a; i < MAX; i++)
        {
            dp2[i] = min(dp2[i], dp2[i - a] + 1);
        }
    }

    while (1)
    {
        int n;
        cin >> n;
        if (n == 0)
            break;
        cout << dp1[n] << "" << dp2[n] << endl;
    }
    return 0;
}

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

using namespace std;

int N;
int dp[1000001], dpodd[1000001];

int main() {

	//前計算でdpテーブルを計算。8sもあるのでオーダーは怪しいけど大丈夫のはず

	for (int i = 0; i <= 1000000; i++)dp[i] = 1145141919, dpodd[i] = 1145141919;

	dp[0] = 0, dpodd[0] = 0;
	for (int i = 1; i <= 180; i++) {
		int cur = i * (i + 1) * (i + 2) / 6;
		for (int j = 1; j <= 1000000; j++) {
			if (i % 2 == 1) {
				if (j - cur >= 0)dpodd[j] = max(dpodd[j], dpodd[j - 1] + 1);
			}

			if (j - cur >= 0)dp[j] = min(dp[j], dp[j - cur] + 1);
		}
	}

	while (1) {
		cin >> N;
		if (N == 0)break;
		cout << dp[N] << " " << dpodd[N] << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int c1[100000],c2[100000],i,m,p=0,dp1[100001],dp2[100001],k;
  for(i=0;i*(i+1)*(i+2)/6<=100000;i++){
    c1[i]=i*(i+1)*(i+2)/6;
    if(c1[i]%2==1){
      c2[p]=c1[i]; 
      p++; 
    }
  }
  while(1){
  cin >>m;
  if(m==0)break;
  for(int j=0;j<=m;j++){
    dp1[j]=j;
    dp2[j]=j;
    for(int k=0;k<i;k++){
      if(j-c1[k]>=0)dp1[j]=min(dp1[j],dp1[j-c1[k]]+1);
      if(k<p)
	if(j-c2[k]>=0){
	dp2[j]=min(dp2[j],dp2[j-c2[k]]+1);
       }
    }
  }
  cout << dp1[m]<<" "<<dp2[m]<<endl;
  }
 return 0;
}

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

#define N 1000001
int dp[N], dp_o[N];

int main(void) {
  for (int i = 0; i < N; i++) {
    dp[i] = i;
    dp_o[i] = i;
  }
  
  for (int i = 2; i < N; i++) {
    int p = i * (i + 1) * (i + 2) / 6;
    if (p > N) break;
    for (int j = 0; j < N - p; j++)
      dp[j+p] = min(dp[j+p], dp[j] + 1);
    if(p % 2 == 1) {
      for(int j = 0; j < N - p; j++) 
	dp_o[j + p] = min(dp_o[j + p], dp_o[j] + 1);
    }
  }

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

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(int i = 0; i < n; i++)



int main() {
    ll s4[101];
    vector<ll> s4_k;
    s4[0] = 1;
    for(int i = 1; i < 101; i++){
        s4[i] = i * (i + 1) * (i + 2) / 6;
        if(s4[i] & 1){
            s4_k.push_back(i * (i + 1) * (i + 2) / 6);
            // cout << s4[i] << endl;
        }
    }
    
    ll n;
    cin >> n;
    while(n != 0){
        vector<ll> dp(n + 1, INF);
        dp[0] = 0;
        
        REP(i, 101){
            REP(j, n + 1){
                if(s4[i] <= j){
                    dp[j] = min(dp[j], dp[j - s4[i]] + 1);
                }
            }
        }
        
        /*
        REP(i, 5){
            REP(j, n + 1){
                cout << dp[i][j] << ' ';
            }
            cout << endl;
        }
        */
        
        cout << dp[n] << ' ';
        
        
        
        REP(i, n + 1){
            dp[i] = INF;
        }
        dp[0] = 0;
        
        for(int i = 0; i < s4_k.size(); i++){
            REP(j, n + 1){
                if(s4_k[i] <= j){
                    dp[j] = min(dp[j], dp[j - s4_k[i]] + 1);
                }
            }
        }
        
        /*
        REP(i, 5){
            REP(j, n + 1){
                cout << dp[i][j] << ' ';
            }
            cout << endl;
        }
        */
        
        cout << dp[n] << endl;
        
        
        
        cin >> n;
    }
}

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

const int MAX_N = 1e+6;
const int INF = 1e+8;

int f(int n){
	return n * (n+1) * (n+2) / 6;
}

int dp[2][MAX_N+1] = {0};

int main(){
	for(int i=0 ; i < MAX_N ; i++ ){
		dp[0][i] = dp[1][i] = INF;
	}
	for(int i=1 ; f(i) < MAX_N ; i++ ){
		dp[0][f(i)] = 1;
		if( f(i) % 2 )
			dp[1][f(i)] = 1;
	}
	for(int i=1 ; i < MAX_N ; i++ ){
		if( dp[0][i] != INF ){
			for(int j=1 ; i + f(j) < MAX_N ; j++ ){
				dp[0][i+f(j)] = min( dp[0][i+f(j)] , dp[0][i]+1 );
			}
		}
		if( dp[1][i] != INF ){
			for(int j=1 ; i + f(j) < MAX_N ; j++ ){
				if( f(j) % 2 )
					dp[1][i+f(j)] = min( dp[1][i+f(j)] , dp[1][i]+1 );
			}
		}
	}
	
	int n;
	while( cin >> n , n ){
		cout << dp[0][n] << " " << dp[1][n] << endl;
	}
}