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 <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007

#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;

/*---------------------------------------------------*/

int dp[1000005],odd_dp[1000005];
vector<int> pol;

void init(){
  REP(i,1,1000){
    int num=i*(i+1)*(i+2)/6;
    if(num>1000000)break;
    pol.pb(num);
    //cout<<num<<endl;
  }
  rep(i,1000005)dp[i]=odd_dp[i]=i;
}

void DP(){
  bool ok;
  REP(i,1,pol.size()){
    ok=true;
    for(int j=pol[i];j<1000005;j++){
      if(j-dp[i]>=0)dp[j]=min(dp[j],dp[j-pol[i]]+1);
      if(pol[i]%2)if(j-odd_dp[i]>=0)odd_dp[j]=min(odd_dp[j],odd_dp[j-pol[i]]+1);
    }
  }
}

int main(){
  init();
  DP();
  int n;
  while(cin>>n,n){
    cout<<dp[n]<<" "<<odd_dp[n]<<endl;
  }
  return 0;
}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const int N = 1000000;
const int mod = 1000000007;
const int INF = 1 << 30;
#define rep(i,n) for(int i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define fix(n) fixed<<setprecision(n)
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll ss[5000];//正四面体数
vector<ll>v;
ll dp[10000000], dp2[10000000];
int main() {
	v.pb(0);
	ll n, now = 1, now2 = 1;
	rep(i, 5000) {
		ss[i] = (ll)(i*(i + 1)*(i + 2) / 6);
		if (ss[i] % 2 == 1)v.pb(ss[i]);
	}
	rep(i, 1000000) {
		if (i < 2) { dp[i] = i; dp2[i] = i;continue; }
		if (i >= ss[now + 1])++now;
		dp[i] = i / ss[now] + dp[i%ss[now]];
		for (int j = now - 1; j >= 1; --j)dp[i] = min(dp[i], (ll)i / ss[j] + dp[i%ss[j]]);
		if (i >= v[now2 + 1])++now2;
		dp2[i] = i / v[now2] + dp2[i%v[now2]];
		for (int j = now2 - 1; j >= 1; --j)dp2[i] = min(dp2[i], (ll)i / v[j] + dp2[i%v[j]]);
	}
	while (cin >> n, n) {
		rep(i, n)cout << i << "ha" << dp[i] << endl;
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <numeric>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 10007;
constexpr int INF = 2000000000;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);

int dp[1001000],dp2[1001000];
vector<int> pollock, pollock2;
int main() {
	for (int i = 1;; i++) {
		LL num = i*(i + 1)*(i + 2)/6;

		if (num > 1000000)break;

		if (num % 2 == 0)pollock2.emplace_back(num);
		pollock.emplace_back(num);
	}
	//cout << 1 << endl;
	for (int i = 0; i < 1000000; i++) {
		dp[i] = dp2[i] = i;
	}
	//cout << 2 << endl;
	for (int i = 1; i < pollock.size(); i++) {
		for (int j = pollock[i]; j <= 1000000; j++) {
			dp[j] = min(dp[j], dp[j - pollock[i]] + 1);
		}
	}
	//cout << 3 << endl;
	for (int i = 1; i < pollock2.size(); i++) {
		for (int j = pollock2[i]; j <= 1000000; j++) {
			dp2[j] = min(dp2[j], dp2[j - pollock2[i]] + 1);
		}
	}
	//cout << 4 << endl;
	int n;
	while (cin >> n&&n) {
		cout << dp[n] << " " << dp2[n] << endl;
	}
}