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"

#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[a]; if (a != 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);
	vi dp(1000001), dp2(1000001);
	for (int i = 0; i*(i + 1)*(i + 2) / 6 <= 1000000; ++i) {
		int k = i*(i + 1)*(i + 2) / 6;
		REP(j, 1000001-k) {
			dp[j + k] = min(dp[j + k], dp[j] + 1);
		}
	}
	for (int i = 0; i*(i + 1)*(i + 2) / 6 <= 1000000; ++i) {
		int k = i*(i + 1)*(i + 2) / 6;
		if (k % 2 == 0)continue;
		REP(j, 1000001 - k) {
			dp2[j + k] = min(dp2[j + k], dp2[j] + 1);
		}
	}
	while (1) {
		int n;
		cin >> n;
		if (!n)break;
		cout << dp[n] <<" "<<dp2[n]<< endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <tuple>
#include <complex>
#include <cassert>
#include <exception>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<P> vp;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << "\n"
static const int INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[200010],dp[3000][3000];
char field[200][200];

ll max_p[200010],min_p[200010];

void func(){
  max_p[0] = min_p[0] = 0;
  rep(i,1,200010){
    min_p[i] = max_p[i] = i;
    rep(j,1,200010){
      ll test = j * (j + 1) * (j + 2) / 6;
      if(i - test < 0)break;
      min_p[i] = min(min_p[i] ,min_p[i - test] + 1);
      if(test % 2)max_p[i] = min(max_p[i],max_p[i - test] + 1);
    }
  }
}

int main(){
  func();
  while(cin >> n,n){
    cout << min_p[n] << " " << max_p[n] << endl;
  }
  return 0;
}

C++: /*
    Problem 44
    https://onlinejudge.u-aizu.ac.jp/problems/1167
*/
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 1000005;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
vector<int> dpAll(MAX, INF), dpOdd(MAX, INF);
vector<int> sqAll, sqOdd;
/* function */
int calcSq(int x) { return x * (x+1) * (x+2) / 6; }
void initSq() {
    for (int i = 1; i < MAX; i++) {
        int cost = calcSq(i);
        if (cost >= MAX) break;
        sqAll.push_back(cost);
        if (cost % 2 == 1)
            sqOdd.push_back(cost);
    }
}
void calcDP() {
    dpAll[0] = 0;
    for (int i = 0; i < sqAll.size(); i++) {
        for (int j = sqAll[i]; j < MAX; j++) {
            dpAll[j] = min(dpAll[j], dpAll[j-sqAll[i]] + 1);
        }
    }
    dpOdd[0] = 0;
    for (int i = 0; i < sqOdd.size(); i++) {
        for (int j = sqOdd[i]; j < MAX; j++) {
            dpOdd[j] = min(dpOdd[j], dpOdd[j-sqOdd[i]] + 1);
        }
    }
}
int calcAll(int m) { return dpAll[m]; }
int calcOdd(int m) { return dpOdd[m]; }
/* main */
int main(){
    vector<int> query;
    while (1) {
        int q; cin >> q;
        if (q == 0) break;
        query.push_back(q);
    }
    initSq();
    calcDP();
    for (int q : query)
        cout << calcAll(q) << ' ' << calcOdd(q) << '\n';
}

C++: #include <iostream>
#include <fstream>

using namespace std;

int z1[1000000] = { 0 };
int z2[1000000] = { 0 };

void pollock(int n) {
	for (int i = 1; i*(i + 1)*(i + 2) / 6 <= n; i++) {
		z1[i*(i + 1)*(i + 2) / 6] = 1;
		if ((i*(i + 1)*(i + 2) / 6) % 2 == 1) z2[i*(i + 1)*(i + 2) / 6] = 1;
	}

	for (int i = 2; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			if (z1[i] == 0 || (z1[i] != 0 && z1[j] + z1[i - j] < z1[i])) z1[i] = z1[j] + z1[i - j];
			if (z2[i] == 0 || (z2[i] != 0 && z2[j] + z2[i - j] < z2[i])) z2[i] = z2[j] + z2[i - j];
		}
	}

	cout << z1[n] << " " << z2[n] << endl;
}

int main() {
	int n;
	cin >> n;
	pollock(n);
	
	return 0;
}