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 <vector>
#include <cmath>
#include <cstring>

using namespace std;

int MAX;
vector<int> V;
vector<int> D;
int N;
int M;
bool dp[10][100000] = {0};

void solve(int n) {
	int ans = 1;

	for (int i=0; V[i]<=n; i++)
		dp[0][V[i]] = 1;

	for (int i=1; i<5 && !dp[i-1][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++) {
			if (!dp[i-1][j]) continue;
			for (int k=0; j+V[k]<=n; k++)
				dp[i][j+V[k]] = 1;
			if (dp[i][n]) break;
		}
	}

	cout << ans << " ";

	memset(dp, 0, sizeof(dp));

	ans = 1;

	for (int i=0; D[i]<=n; i++)
		dp[0][D[i]] = 1;

	for (int i=1; i<=100000 && !dp[1-i%2][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++) {
			//dp[i%2][j] = 0;
			if (!dp[1-i%2][j]) continue;
			for (int k=0; j+D[k]<=n; k++)
				dp[i%2][j+D[k]] = 1;
			if (dp[i%2][n]) break;
		}
	}

	cout << ans << endl;
}

int main() {
	MAX = (int)pow(10.0, 6);
	for (int i=1; i*(i+1)*(i+2)/6<=MAX; i++) {
		V.push_back(i*(i+1)*(i+2)/6);
		if ( V[i-1]%2==1 ) D.push_back(i*(i+1)*(i+2)/6);
	}
	N = (int)V.size();
	M = (int)D.size();

	int n;
	cin >> n;
	while (n!=0) { 
		solve(n);
		cin >> n;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[190]={0},b[60]={0},c[200001]={0,1,2,3},d[200001],k=0,i,j,n;
  for(i=1;i<100;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<99;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

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

int main(){
  int i,ki[1000001],all[1000001],n[200],a;
  for(i=0;;i++){
    n[i]=i*(i+1)*(i+2)/6;
    if(n[i]>1000000)break;
  }
  for(int j=0;j<=1000000;j++){
    ki[j]=j;
    all[j]=j;
  }
  for(int j=2 ; j<i ; j++){
    for(int k=n[j];k<=1000000;k++){
      all[k]=min(all[k],all[k-n[j]]+1);
      if(n[j]%2==1){
      ki [k]=min(ki [k],ki[k-n[j]]+1);
      }
    }
  }
  while(1){
    cin>>a;
    if(a==0)break;
    cout<<all[a]<<" "<<ki[a]<<endl;
  }

  return 0;
}

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

C++: #include <iostream>
using namespace std;
int main(){
  int a[200]={0},b[150]={0},c[1200001]={0,1,2,3},d[1200001],k=0,i,j,n,p;
  for(i=1;a[i-1]<1000000;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0,p=i;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<p;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

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

const int inf = 1000000009;

int main() {
    vector<vector<int>> memo(85, vector<int>(1000000, inf));
    vector<vector<int>> odd_memo(85, vector<int>(1000000, inf));
    for (int i=0; i<1000000; i++) {
        memo[0][i] = 0;
        odd_memo[0][i] = 0;
    }

    for (int i=0; i<1000000; i++) {
        memo[1][i] = i;
        odd_memo[1][i] = i;
    }

    for (int l=2; l<(int)memo.size(); l++) {
        const int n = (l*(l+1)*(l+2))/6;
        for (int i=0; i<(int)memo[l].size(); i++) {
            if(i-n == 0) {
                memo[l][i] = 1;
            } else if(i-n > 0) {
                memo[l][i] = min(memo[l][i-n]+1, memo[l-1][i]);
            } else {
                memo[l][i] = memo[l-1][i];
            }

            if (l%2==1) {
                if(i-n == 0) {
                    odd_memo[l][i] = 1;
                } else if(i-n > 0) {
                    odd_memo[l][i] = min(odd_memo[l][i-n]+1, odd_memo[l-1][i]);
                } else {
                    odd_memo[l][i] = odd_memo[l-1][i];
                }
            } else {
                odd_memo[l][i] = odd_memo[l-1][i];
            }
        }
    }

    int n; 
    while (cin >> n, n!=0) {
        cout << memo[memo.size()-1][n] << " " << odd_memo[odd_memo.size()-1][n] << endl;
    }
}