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>
#define N 1000000
#define INFINITY 2000000000
using namespace std;
int DP(int);
int DP2(int);
int m=1,m2=1;
int dp[N],dp2[N],data[N];
vector<int> data2;
int main(){
  int i,out,out2,n,c;
  data2.push_back(0);
  for(i=1;i<N;i++){
    data[i]=i*(i+1)*(i+2)/6;
    if(data[i]>N){
      c=i;
    }
    if(data[i]%2==1){
      data2.push_back(data[i]);
    }
  }
  while(1){
    cin >> n;
    if(n==0) break;
    out=DP(n);
    out2=DP2(n);
    cout << out << ' ' << out2 << endl;
  }
  return 0;
}
int DP(int n){
  int i,j,s;
  for(i=1;i<N;i++){
    if(data[i]>n){
      s=i-1;
      break;
    }
  }
  if(s>=m){
    m=s;
    for(i=0;i<=n;i++) dp[i]=INFINITY;
    dp[0]=0;
    for(i=1;i<=s;i++){
      for(j=data[i];j<=n;j++){
	dp[j]=min(dp[j],dp[j-data[i]]+1);
      }
    }
  }
  return dp[n];
}
int DP2(int n){
  int i,j,s,len;
  len=data2.size();
  for(i=1;i<len;i++){
    if(data2[i]>n){
      s=i-1;
      break;
    }
  }
  if(s>=m2){
    m2=s;
    for(i=0;i<=n;i++) dp2[i]=INFINITY;
    dp2[0]=0;
    for(i=1;i<=s;i++){
      for(j=data2[i];j<=n;j++){
	dp2[j]=min(dp2[j],dp2[j-data2[i]]+1);
      }
    }
  }
  return dp2[n];
}

C++: #include<bits/stdc++.h>
const int MAX=1e6+10;
using namespace std;
int main(){
    vector<int>precal;
    vector<int>dp(MAX,MAX);
    vector<bool>flag(MAX,false);
    int n;
    precal.push_back(0);
    dp[0]=0;
    for(int i=1;;i++){
        int cnt=((i)*(i+1)*(i+2))/6;
        if(cnt>MAX)break;
        precal.push_back(cnt);
        flag[cnt]=true;
    }
    for(int i=1; i<=MAX-9;i++){
        if(flag[i]){dp[i]=1; continue;}
        int index=(int)(upper_bound(precal.begin(),precal.end(),i)-precal.begin());
        for(int j=0; j<=index;j++)
            dp[i]=min(dp[i],dp[precal[j]]+dp[i-precal[j]]);
    }
    vector<int>oddcal;
    vector<int>odp(MAX,MAX);
    vector<bool>oddflag(MAX,false);
    oddcal.push_back(0);
    odp[0]=0;
    for(int i=1;;i++){
        int cnt=(i*(i+1)*(i+2))/6;
        if(cnt>MAX)break;
        if(!(cnt%2))continue;
        oddcal.push_back(cnt);
        oddflag[cnt]=true;
    }
    for(int i=1; i<=MAX-9;i++){
        if(oddflag[i]){odp[i]=1;continue;}
        int index=(int)(upper_bound(oddcal.begin(), oddcal.end(), i)-oddcal.begin());
        for(int j=0;j<=index;j++)
            odp[i]=min(odp[i],odp[oddcal[j]]+odp[i-oddcal[j]]);
        
    }
    while(cin>>n,n){
        cout<<dp[n]<<" "<<odp[n]<<endl;
    }
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[200]={0},b[200]={0},c[1000001],d[1000001],k=0,i,j,n;

  for(i=0;i<200;i++)a[i]=i*(i+1)*(i+2)/6;

  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];

  for(i=0;i<1000000;i++)c[i]=d[i]=i;

  for(i=1;i<195;i++)for(j=a[i];j<a[i+1];j++){
    if(j>1000000)break;
    c[j]=c[j-a[i]]+1;
  }
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++){
    if(j>1000000)break;
    d[j]=d[j-b[i]]+1;
  }
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;

int MX = 1000000;
vector<int> polo;
vector<int> dp0(MX+1,-1);
vector<int> dp1(MX+1,-1);

int dfs0(int x = MX){
        if(dp0.at(x) >= 0) return dp0.at(x);
        int res = INF;
        for(auto p:polo){
                if(x-p < 0) break;
                res = min(res,dfs0(x-p)+1);
        }
        return dp0.at(x) = res;
}

int dfs1(int x = MX){
        if(dp1.at(x) >= 0) return dp1.at(x);
        int res = INF;
        for(auto p:polo){ 
                if(p%2 == 0) continue;
                if(x-p < 0) break;
                res = min(res,dfs1(x-p)+1);
        }
        return dp1.at(x) = res;
}


int main() {
        int i = 1;
        while(1){
                int x = i*(i+1)*(i+2)/6;
                if(x > MX) break;
                polo.push_back(x);
                i++;
        }
        
        dp0.at(0) = 0;
        dp1.at(0) = 0;
        
        dfs0();
        dfs1();
        
        while(1){
                int p;
                cin >> p;
                if(p==0) break;
                cout << dp0.at(p) << " " << dp1.at(p) << endl;
        }
    
        return 0;
}

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

#define INF (1<<28)

int t[1000*1000+1];
int ot[1000*1000+1];

void init() {
    fill(t, t+1000*1000+1, INF);
    fill(ot, ot+1000*1000+1, INF);
    for (int i = 1; ; i++) {
        int n = i * (i+1) * (i+2) / 6;
        if (n > 1000*1000) break;
        t[n] = 1;
        if (n % 2) ot[n] = 1;
    }

    for (int i = 1; i <= 1000*1000; i++) {
        for (int j = 1; ; j++) {
            int p = j * (j+1) * (j+2) / 6;
            if (i <= p) break;
            t[i] = min(t[i], t[i-p] + 1);
            if (p % 2) ot[i] = min(ot[i], ot[i-p] + 1);
        }
    }
}

int main() {
    init();
    int n;
    while (scanf("%d", &n), n) {
        printf("%d %d\n", t[n], ot[n]);
    }
    return 0;
}