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 lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}

void calc(int a[],int f){
  for(int i=f*(f+1)*(f+2)/6;i<=1000000;i++){
    if(a[i]==0) a[i]=a[i-f*(f+1)*(f+2)/6]+1;
    else if(a[i]>a[i-f*(f+1)*(f+2)/6]+1) a[i]=a[i-f*(f+1)*(f+2)/6]+1;
  }
}

int x[1000001],b[1000001];
int main(){
  for(int i=1;i*(i+1)*(i+2)/6<1000000;i++){
    calc(x,i);
  }
  for(int i=1;i*(i+1)*(i+2)/6<1000000;i++){
    if(i*(i+1)*(i+2)/6%2==1)
    calc(b,i);
  }
  while(1){
    int z;
    cin>>z;
    if(z==0) break;
    cout<<x[z]<<" "<<b[z]-3<<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;
	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; 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]]);
	}
	now = 1;
	rep(i, 1000000) {
		if (i < 2) { dp2[i] = i; continue; }
		if (i >= v[now + 1])++now;
		dp2[i] = i / v[now] + dp2[i%v[now]];
		for (int j = now - 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<stdio.h>
#include<math.h>
#define MAX (int)1e+6

int main(void){
  int i,j,n;
  int a[181],b[46];
  int dp1[MAX],dp2[MAX];

  b[0] = 0;
  j = 1;
  for(i=0;i<181;i++){
    a[i] = i * (i+1) * (i+2) / 6;
    if(a[i]&1)b[j++] = a[i];
  }

  for(i=0;i<MAX;i++)dp1[i] = dp2[i] = 1000000;

  for(i=0;i<MAX;i++){
    for(j=0;j<181;j++){
      if(i>a[j])dp1[i] = min(dp1[i],dp1[i-a[j]]+1);
      else if(i==a[j])dp1[i]=1;
      else break;
    }
  }
  
  for(i=0;i<MAX;i++){
    for(j=0;j<46;j++){
      if(i>b[j])dp2[i] = min(dp2[i],dp2[i-b[j]]+1);
      else if(i==b[j])dp2[i]=1;
      else break;
    }
  }

  while(scanf("%d",&n) && n)printf("%d %d\n",dp1[n],dp2[n]);
  return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <valarray>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <limits>
#include <numeric>
#include <utility>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <regex>
#include <array>
#include <bitset>
#include <complex>
#include <tuple>
#include <random>

using namespace std;
using ll = long long;
const int INF = 1e9;
const ll MOD = 1e9 + 7;

int main()
{
  int a[1000000], b[1000000];
  a[0] = b[0] = 0;
  for (int i = 1; i < 1000000; ++i)
  {
    a[i] = b[i] = i;
    for (int j = 1;; ++j)
    {
      int t = j * (j + 1) * (j + 2) / 6;
      if (t > i)
        break;
      a[i]=min(a[i],a[i-t]+1);
      if(t%2==1)
      {
        b[i]=min(b[i],b[i-t]+1);
      }
    }
  }
  int n;
  while (cin >> n, n)
  {
    cout<<a[n]<<' '<<b[n]<<endl;
  }

  return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define mrep(i,n) for(ll i=n;i>=0;--i)
#define all(a) (a).begin(),(a).end()
#define vl vector<ll>
#define vvl vector<vector<ll> >
#define vb vector<bool>
#define vvb vector<vector<bool> >
#define pl pair<ll,ll>
#define inf 1001001001001001000
//#define mod 1000000007
#define mod 2
#define pi 3.1415926535
using namespace std;
struct __INIT{
    __INIT(){
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout<<fixed<<setprecision(15);
    }
}__init;

ll dp[1004732];
ll dp2[1004732];

int main(void){
    vl sikaku;
    vl skisu;
    ll N=185;
    rep(n,N){
        sikaku.push_back((n*(n+1)*(n+2))/6);
    }
    rep(i,1004732){
        dp2[i] = inf;
        dp[i] = inf;
    }
    dp2[0] = 0;
    dp[0] = 0;
    rep(i,185) rep(j,1004732){
        if(j < sikaku[i]) continue;
        dp2[j] = min(dp2[j],dp2[j-sikaku[i]]+1);
        if(sikaku[i]%2 == 1) dp[j] = min(dp[j],dp[j-sikaku[i]]+1);
    }
    while(true){
        ll n;
        cin>>n;
        if(n == 0) break;
        cout<<dp2[n]<<" "<<dp[n]<<endl;;
    }
}