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

#define REP(i,n) for(int i=0;i<(n);i++)
#define int long long
#define ALL(x) (x).begin(),(x).end()
typedef pair<int, int> pii;



vector<int>v,v_even;
int dp[1000010],dp_even[1000010];
int calc(int n){
    return n*(n+1)*(n+2)/6;
}

int rec(int n){
    if(n==0)return 0;
    if(dp[n])return dp[n];
    else{
        int res = 1e9;
        for(auto x:v){
            if(x>n)break;
            res=min(res,rec(n-x)+1);
        }
        return dp[n]=res;
    }
}
int rec_even(int n){
    if(n==0)return 0;
    if(dp_even[n])return dp_even[n];
    else{
        int res = 1e9;
        for(auto x:v_even){
            if(x>n)break;
            res=min(res,rec_even(n-x)+1);
        }
        return dp_even[n]=res;
    }

}
void solve() {
    for(int i=1;i<10000;i++){
        int num=calc(i);
        if(calc(i)>=1e6){
            break;
        }
        else{
            v.push_back(num);
            if(num&1)v_even.push_back(num);
        }
    }
    while(true){
        int n;cin>>n;
        if(n==0)exit(0);
        cout<<rec(n)<<" "<<rec_even(n)<<endl;
    }
}

signed main() {
	solve();
}

C++: #include <iostream>
#include <algorithm>
#define N 1000000
#define INFINITY 2000000000
using namespace std;
int main(){
  int n,cpn,data[N],i,cnt,minv,cal,l,s;
  for(i=1;i<=N;i++) data[i]=(i*(i+1)*(i+2))/6;
  while(1){
    cin >> n;
    if(n==0) break;
    for(i=1;i<=n;i++){
      if(n<=data[i]){
	s=i+1;
	break;
      }
    }
    cnt=s;
    cpn=n;
    minv=INFINITY;
    l=0;
    while(cnt){
      n=cpn;
      cal=0;
      for(i=s-l;i>=1;i--){
	cal+=n/data[i];
	n%=data[i];
      }
      minv=min(minv,cal);
      cnt--;
      l++;
    }
    cout << minv;
    n=cpn;
    cnt=s;
    minv=INFINITY;
    l=0;
    while(cnt){
      n=cpn;
      cal=0;
      for(i=s-l;i>=1;i--){
	if(data[i]%2==1){
	  cal+=n/data[i];
	  n%=data[i];
	}
      }
      minv=min(minv,cal);
      cnt--;
      l++;
    }
    cout << ' ' << minv << endl;
  }
  return 0;
}

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

using namespace std;

int main(void) {
	int lim = 1000000;
	int dp[lim],odp[lim];
	for (int i = 0; i < lim; ++i) {
		dp[i] = i;
		odp[i] = i;
	}

	int num = 4;
	for (int now = 2; num < lim; ++now) {
		for (int i = num; i < lim; ++i) {
			dp[i] = min(dp[i],dp[i-num]+1);
		}
		if (num%2 == 1) {
			for (int i = num; i < lim; ++i) {
				odp[i] = min(odp[i],odp[i-num]+1);
			}
		}
		num = ((now+1)*(now+2)*(now+3))/6;
	}

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

	return 0;
}

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

using namespace std;

const int SIZE = 181 + 1;
const int MAX = 1000000;

int T[SIZE];
int cost1[MAX], cost2[MAX];

int main( void )
{	
	for(int i=0; i < SIZE; ++i) T[i] = i * (i + 1) * (i + 2) / 6;

	for(int i=0; i < MAX; ++i) cost1[i] = cost2[i] = MAX << 1;
	cost1[0] = cost2[0] = 0;
	for(int i=0; i < MAX; ++i) {
			for(int j=0; j < SIZE; ++j) {
				if(i + T[j] < MAX && cost1[i] < 5)
					cost1[i + T[j]] = min(cost1[i + T[j]], cost1[i] + 1);
				if(T[j] & 1) {
					if(i + T[j] < MAX)
						cost2[i + T[j]] = min(cost2[i + T[j]], cost2[i] + 1);
				}
			}
	}
	int n;
	while(cin >> n, n) {
		cout << cost1[n] << ' ' << cost2[n] << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#define INF (int)(1e9)
#define MAXN 1000001
using namespace std;

int sankaku[500];
int simen[500];
int simen2[500];
int maxi,maxj;
int dp[MAXN];
int dp2[MAXN];

void solve(){
  int i,j,t;
  int n=1111111;
  for(i=0;i<MAXN;i++){
    dp[i]=dp2[i]=INF;
  }
  dp[0]=dp2[0]=0;
  for(i=0;i<=maxj;i++){
    t=simen[i];
    for(j=t;j<MAXN;j++){
      dp[j]=min(dp[j],dp[j-t]+1);
    }
  }

  for(i=0;i<=maxi;i++){
    t=simen2[i];
    //if(t%2==0) continue;
    for(j=t;j<MAXN;j++){
      dp2[j]=min(dp2[j],dp2[j-t]+1);
    }
  }
}


int main(void){
  int n,i,j,t;
  t=i=j=1;
  sankaku[0]=1;
  simen[0]=1;
  simen2[0]=1;
  while(simen[j-1]<MAXN){
    sankaku[j]=sankaku[j-1]+j+1;
    simen[j]=simen[j-1]+sankaku[j];
    t=simen[j++];
    if(t%2==1) simen2[i++]=t;
  }
  maxi=i;
  maxj=j;
  
  solve();
  /*
  for(i=0;i<10;i++){
    printf("%d : %d   %d\n",i,simen[i],simen2[i]);
  }
  */
  while(scanf("%d",&n),n){
    cout<<dp[n]<<" "<<dp2[n]<<endl;
  }
  
  return 0;
}