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;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long 

int odd[10101010],even[10101010];
int main() {
	vector<int>a,b;
	int cnt=0;
	for(int i=1;i<=10101010;i++){
		int x=i*(i+1)*(i+2)/6;
		if(x>10101010)break;
		a.push_back(x);
		if(x%2==1) b.push_back(x);
	}
	//cout<<"kazua"<<a.size()<<" kazub"<<b.size()<<endl;
	rep(i,a.size()){
		int cnt=1;
		while(a[i]*cnt<10101010){
    		if(a[i]*cnt<10101010){
				even[a[i]*cnt]=cnt;
			}else break;
			cnt++;
		}
	}
	rep(i,b.size()){
		int cnt=1;
		while(b[i]*cnt<10101010){
			if(b[i]*cnt<10101010){
				odd[b[i]*cnt]=cnt;
			}else break;
			cnt++;
		}
	}
	
		//rep(i,1010101){odd[i]=1010101;}
		//rep(i,1010101){even[i]=1010101;}
		rep(j,a.size()){
			for(int i=0;i<10101010;i++){
				if(even[i]!=0&&i+a[j]<10101010)chmin(even[i+a[j]],even[i]+1);
			}
		}
		rep(j,b.size()){
    		for(int i=0;i<10101010;i++){
				if(odd[i]!=0&&i+b[j]<10101010)chmin(odd[i+b[j]],odd[i]+1);
			}
		}
	int n=1;
	while(cin>>n){
		if(n==0)break;
		cout<<even[n]<<" "<<odd[n]<<endl;
	}
	return 0;
}

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

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  const Int M=1e6+100;
  vector<Int> v;
  for(Int i=1;i*(i+1)*(i+2)/6<=M;i++)
    v.emplace_back(i*(i+1)*(i+2)/6);

  const Int INF = 1e8;
  vector<Int> dp(M,INF),dp2(M,INF);
  dp[0]=dp2[0]=0;
  for(Int i=0;i<(Int)v.size();i++){
    for(Int j=0;j<M;j++){
      if(j+v[i]<M){
	chmin(dp[j+v[i]],dp[j]+1);
	if(v[i]&1) chmin(dp2[j+v[i]],dp2[j]+1);
      }
    }
  }
  
  Int n;
  while(cin>>n,n) cout<<dp[n]<<" "<<dp2[n]<<endl;
  return 0;
}

C++: #include <iostream>
#include <utility>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

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

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

const int INF = 1 << 28;

int main()
{
  vector<int> list;
  for(int i = 1; f(i) < 1000000; ++i) {
    list.push_back(f(i));
  }
  int adp[1000000] = {};
  bool done[1000000] = {};
  rep(i, 1000000) {
    adp[i] = INF;
  }
  done[0] = true;
  adp[0] = 0;
  for(auto v : list) {
    rep(i, 1000000 - v) {
      if(done[i]) {
        adp[i + v] = min(adp[i + v], adp[i] + 1);
        done[i + v] = true;
      }
    }
  }

  int n;
  while(cin >> n, n) {
    cout << adp[n];
    int cnt = 0;
    for(int i = list.size() - 1; 0 <= i; --i) {
      if( list[i]&1 && n >= list[i] ) {
        int m = n / list[i];
//        cerr << n << " : " << list[i] << "*" << m << endl;
        cnt += m;
        n -= list[i] * m;
      }
    }
    cout << " " << cnt << endl;
  }

  return 0;
}