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>
using namespace std;
int INF = 100000000;
int main(){
  int n, M = 1000000;
  vector<int> T, T_odd, A(M,INF), odd(M,INF);
  int t = 1, k = 3;
  A[0] = 0;
  odd[0] = 0;
  T.push_back(1);
  T_odd.push_back(1);
  while(t < 1000000){
    T.push_back(t);
    if (t%2) T_odd.push_back(t);
    ++k;
    t *= k;
    t /= (k-3);
  }
  odd.push_back(M);
  for(int i = 0; i < T.size(); ++i){
    for(int j = 1; j <= 5; ++j){
      for(int k = 0; k < T[i] && k+T[i]*j < M; ++k){
	A[k+T[i]*j] = min(A[k+T[i]*j],A[k]+j);
      }
    }
  }
  for(int i = 0; i < T_odd.size()-1; ++i){
    for(int j = 1; T_odd[i]*j < T_odd[i+1]; ++j){
      for(int k = 0; k < T_odd[i] && k+T_odd[i]*j < M; ++k){
	odd[k+T_odd[i]*j] = min(odd[k+T_odd[i]*j],odd[k]+j);
      }
    }
  }
  while(cin >> n, n){
    cout << A[n] << " " << odd[n] << endl;
  }
  return 0;
}

C++: 
// Pollock's conjecture
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167&lang=jp 

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

const int MAX = 1000010;

int t(int n) { return n*(n+1)*(n+2) / 6; }
int main() { 
    vector<int> dp(MAX, 0);
    vector<int> odd_dp(MAX, 0);
    dp[0] = 0;
    odd_dp[0] = 0;
    for (int n = 1; n <= MAX; ++n) {
        dp[n] = n;
        odd_dp[n] = n;
        for (int k = 1; t(k) <= n; ++k) {
            dp[n] = min(dp[n - t(k)] + 1, dp[n]); 
            if (t(k) % 2) {
                odd_dp[n] = min(odd_dp[n - t(k)] + 1, odd_dp[n]); 
            }
        }
    }
    
    int N;
    while (cin >>  N) {
        if (N == 0) break;
        cout << dp[N] << " " << odd_dp[N] << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;

ll dp[2000000];
ll dp2[2000000];
const ll INF = 1e9;
int main() {
  vl A;
  ll x = 0;
  int m = 1;
  while(x<=1000000){
    x = m*(m+1)*(m+2)/6;
    A.push_back(x);
    m++;
    //if(x<100)show(x);
  }
  int k = sz(A);
  fill(dp,dp+2000000,INF);
  fill(dp2,dp2+2000000,INF);
  dp[0] = 0;
  dp2[0] = 0;
  srep(i,1,1000001){
    rep(j,k){
      if((i - A[j])< 0) break;
      dp[i] = min(dp[i],dp[i - A[j]]+1);
      if(A[j]%2)dp2[i] = min(dp2[i],dp2[i - A[j]]+1);
    }  
  }
  //rep(i,100)cout<<i << " " << (dp2[i]) << endl;
  while(1){
    int n;
    cin >> n;
    if(n == 0){
      return 0;
    }
    cout<<dp[n]<<" "<< dp2[n]<<endl;
  }
  
  return 0;
}