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 int long long
#define REP(i,n) for(int i = 0;i < (int)(n);++i)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;--i)
#define FOR(i,s,n) for(int i = s;i < (int)n;++i)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;--i)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
template<class T>inline void out(T t){cout<<t<<"\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout<<t<<" ";out(ts...);}
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
constexpr int INF = 1e18;

int dp[1000200],dp1[1000200];

signed main(){
	vector<int>v;
	FOR(i,1,10000){
		int t = i * (i + 1) * (i + 2) / 6;
		if(t > 1000000)break;
		v.emplace_back(t);
	}
	REP(i,1000200)dp[i] = dp1[i] = INF;
	dp[0] = dp1[0] = 0;
	REP(i,v.size()){
		REP(j,1000001){
			if(v[i] % 2){
				if(j + v[i] <= 1000000)CHMIN(dp1[j+v[i]],dp1[j]+1);
			}
			if(j + v[i] <= 1000000)CHMIN(dp[j+v[i]],dp[j]+1);
		}
	}
	int N;
	while(cin >> N,N){
		out(dp[N],dp1[N]);
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;

ll inf=1e9;

int main() {
  vector<ll> dpe(1e6+1,inf);
  vector<ll> dpo(1e6+1,inf);
  dpe[0]=0;
  dpo[0]=0;
  vector<ll> a;
  for(ll i=1;i*(i+1)*(i+2)/6<dpe.size();i++) {
    a.push_back(i*(i+1)*(i+2)/6);
  } 
  for(ll i=0;i<a.size();i++) {
    if(a[i]%2) {
      for(ll j=0;j<dpe.size();j++) {
        if(a[i]+j>dpe.size()-1) break;
        dpe[j+a[i]]=min(dpe[j+a[i]],dpe[j]+1);
        dpo[j+a[i]]=min(dpo[j+a[i]],dpo[j]+1);
      }
    }
    else {
      for(ll j=0;j<dpe.size();j++) {
        if(a[i]+j>dpe.size()-1) break;
        dpe[j+a[i]]=min(dpe[j+a[i]],dpe[j]+1);
      }
    }
  }
  while(1) {
    ll n;
    cin >> n;
    if(n==0) break;
    cout << dpe[n] << " " << dpo[n] << endl;
  }
}

C++: #include<cstdio>
#include<algorithm>
using namespace std;

const int N = 1000000;
int dp[2][N+1],nxt,val,i,j,n;

int main(){
  for(i=0;i<=N;i++)dp[0][i] = dp[1][i] = N;
  dp[0][0] = dp[1][0] = 0;

  val = 1;
  for(i=1;val<=N;i++){
    for(j=0;j+val<=N;j++){
      nxt = j+val;
      dp[0][nxt] = min(dp[0][nxt],dp[0][j] + 1);
      if(val&1)dp[1][nxt] = min(dp[1][nxt],dp[1][j] + 1);
    }
    val = i*(i+1)*(i+2)/6;
  }

  while(scanf("%d",&n),n)printf("%d %d\n",dp[0][n],dp[1][n]);
}

C++: #include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)///

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	while (cin >> n, n) {
		vi v;
		FOR(i, 1, INF) {
			v.push_back(i*(i + 1)*(i + 2) / 6);
			if (v[i-1] >= n)break;
		}
		int m = v.size();
		vvi dp(m + 1, vi(n + 1, INF));
		dp[0][0] = 0;
		REP(i, m) {
			REP(j, n + 1) {
				if (j < v[i])dp[i + 1][j] = dp[i][j];
				else dp[i + 1][j] = min(dp[i][j] , dp[i+1][j - v[i]]+1);
			}
		}
		cout << dp[m][n] << " ";
		vvi dp2(m + 1, vi(n + 1, INF));
		dp2[0][0] = 0;
		REP(i, m) {
			if (v[i] % 2 == 0) {
				REP(j, n + 1)dp2[i + 1][j] = dp2[i][j];
			}
			else {
				REP(j, n + 1) {

					if (j < v[i])dp2[i + 1][j] = dp2[i][j];
					else dp2[i + 1][j] = min(dp2[i][j], dp2[i + 1][j - v[i]] + 1);
				}
			}
		}
		cout << dp2[m][n] << endl;
	}
}

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


int main(){
    vector<int> num;
    for(long long int i=1;;i++){
        if(i*(i+1)*(i+2)/6>1e6)
            break;
        num.push_back(i*(i+1)*(i+2)/6);
    }
    vector<int> dp1(1e6+1,1e7);
    vector<int> dp2(1e6+1,1e7);
    dp1[0]=0,dp2[0]=0;
    for(int i=1;i<dp1.size();i++){
        for(int r=0;r<num.size() ;r++){
            if(num[r]>i) break;
            dp1[i]=min(dp1[i],dp1[i-num[r]]+1);
            if(num[r]%2==1){
                dp2[i]=min(dp2[i],dp2[i-num[r]]+1);
            }
        }
    }
    int n;
    while(cin>>n,n){
        cout<<dp1[n]<<" "<<dp2[n]<<endl;
    }
    return 0;
}