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<map>
using namespace std;

vector<unsigned int> triq,subtriq;
map<unsigned int,unsigned int> cld,subcld;
void addtriq(unsigned int max){
	while(triq.back()<max){
		triq.push_back((triq.size()+1)*(triq.size()+2)*(triq.size()+3)/6);
		if(triq.back()%2==1)subtriq.push_back(triq.back());
	}
	return;
}

unsigned int calc(unsigned int cur,vector<unsigned int>& list,map<unsigned int,unsigned int>& cld,unsigned int& cmin,unsigned int cstp){
	unsigned int sub,ret=-1;
	map<unsigned int,unsigned int>::iterator it;
	if(cstp>=cmin){
		cld.insert(pair<unsigned int,unsigned int>(cur,-1));
		return -1;
	}
	it=cld.find(cur);
	if(it!=cld.end()){
		return (*it).second;
	}
	for(vector<unsigned int>::reverse_iterator ri=list.rbegin();ri!=list.rend();++ri){
		int d=cur-(*ri);
		if(d==0){
			cmin=cstp;
			return cstp;
		}
		if(d>0){
			sub=calc(d,list,cld,cmin,cstp+1);
			if(sub<ret)ret=sub;
		}
	}
	cld.insert(pair<unsigned int,unsigned int>(cur,ret));
	return ret;
}

int main(){
	triq.push_back(1);
	subtriq.push_back(1);
	while(true){
		unsigned int n,cmin;
		cin>>n;
		if(n==0)break;
		addtriq(n);
		cmin=-1;
		calc(n,triq,cld,cmin,1);
		cout<<cmin<<' ';
		cmin=-1;
		calc(n,subtriq,subcld,cmin,1);
		cout<<cmin<<endl;
	}
	return 0;
}

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

#define NUM 200
vector<long long int>data1( NUM );
vector<long long int>data2;
vector<long long int>memo1;
vector<long long int>memo2;

long long int saiki1( long long int N ) {
	if( N < 0 ) {
		return INT_MAX / 6;
	}
	if( memo1[N] != INT_MAX / 6 ) {
		return memo1[N];
	}
	long long int ret = INT_MAX / 6;
	auto ite = lower_bound( data1.begin(), data1.end(), N );
	while( ite != data1.begin() ) {
		ret = min( ret, saiki1( N - (*ite) ) + 1 );
		ite--;
	}
	if( ret == INT_MAX / 6 ) {
		ret = N;
	}
	return memo1[N] = ret;
}

long long int saiki2( long long int N ) {
	if( N < 0 ) {
		return INT_MAX / 6;
	}
	if( memo2[N] != INT_MAX / 6 ) {
		return memo2[N];
	}
	long long int ret = INT_MAX / 6;
	auto ite = lower_bound( data2.begin(), data2.end(), N );
	while( ite != data2.begin() ) {
		ret = min( ret, saiki2( N - (*ite) ) + 1 );
		ite--;
	}

	if( ret == INT_MAX / 6 ) {
		ret = N;
	}
	return memo2[N] = ret;
}

int main() {
	memo1.resize( 1e6, INT_MAX / 6 );
	memo2.resize( 1e6, INT_MAX / 6 );
	iota( data1.begin(), data1.end(), 1 );
	for( size_t i = 1; i < NUM; i++ ) {
		data1[i] += data1[i - 1];
	}
	for( size_t i = 1; i < NUM; i++ ) {
		data1[i] += data1[i - 1];
	}
	for( size_t i = 0; i < NUM; i++ ) {
		if( data1[i] % 2 ) {
			data2.emplace_back( data1[i] );
		}
	}
	long long int N;
	while( cin >> N, N ) {
		cout << saiki1( N ) << " " << saiki2( N ) << endl;
	}
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
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];
    
    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=1;
	  tmp=min(dp[i+coin[j]],dp[i]+1);
	  dp[i+coin[j]]=tmp;
	}
      }
    }


    int ans1=dp[x];

  
    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_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	  tmp=1; 
	  tmp=min(dp[i+coin_ki[j]],dp[i]+1);
	  dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    
    int ans2=dp[x];
    
    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}

C++: #include <iostream>
#define REP(i, a, n) for(int i = (a); i <= (n); i++)
#define INF 100000000
using namespace std;

const int M = 1000000;
int N, base1[M + 1], base2[M + 2], dp1[M + 1], dp2[M + 1];

int dfs1(int n) {
  if(dp1[n] >= 0) return dp1[n];
  if(base1[n]) return dp1[n] = 1;

  int ret = INF;
  REP(i, 1, n - 1) ret = min(ret, dfs1(i) + dfs1(n - i));
  return dp1[n] = ret;
}

int dfs2(int n) {
  if(dp2[n] >= 0) return dp2[n];
  if(base2[n]) return dp2[n] = 1;

  int ret = INF;
  REP(i, 1, n - 1) ret = min(ret, dfs2(i) + dfs2(n - i));
  return dp2[n] = ret;
}

int main(void) {
  REP(i, 1, M) dp1[i] = dp2[i] = -1, base1[i] = base2[i] = 0;
  for(int i = 1, n; n = i * (i + 1) * (i + 2) / 6, n <= M; i++) {
    base1[n] = 1;
    if(n % 2 == 1) base2[n] = 1;
  }

  while(cin >> N, N) {
    cout << dfs1(N) << " " << dfs2(N) << endl;
  }

  return 0;
}