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 main()
{
    vector<int> tri;
    vector<int> odd;
    constexpr int MAX = 1000000;
    for (int i = 1;; i++) {
        const int num = i * (i + 1) * (i + 2) / 6;
        if (num >= MAX) {
            break;
        }
        tri.push_back(num);
        if (num % 2 == 1) {
            odd.push_back(num);
        }
    }
    constexpr int INF = 1000000000;
    vector<int> num(MAX, INF);
    vector<int> oddnum(MAX, INF);
    num[0] = 0;
    oddnum[0] = 0;
    for (int i = 0; i < MAX; i++) {
        if (num[i] == INF) {
            continue;
        }
        for (const int p : tri) {
            if (i + p < MAX) {
                num[i + p] = min(num[i + p], num[i] + 1);
            }
        }
    }
    for (int i = 0; i < MAX; i++) {
        if (oddnum[i] == INF) {
            continue;
        }
        for (const int p : odd) {
            if (i + p < MAX) {
                oddnum[i + p] = min(oddnum[i + p], oddnum[i] + 1);
            }
        }
    }


    while (true) {
        int n;
        cin >> n;
        if (n == 0) {
            break;
        }
        cout << num[n] << " " << oddnum[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;
	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 <iostream>
using namespace std;
int main(){
  int a[200]={0},b[200]={0},c[1000001],d[1000001],k=0,i,j,n;

  for(i=0;i<200;i++)a[i]=i*(i+1)*(i+2)/6;

  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];

  for(i=0;i<1000001;i++)c[i]=d[i]=i;

  for(i=1;i<195;i++)for(j=a[i];j<1000001;j++){
    c[j]=min(c[j],c[j-a[i]]+1);
  }
  for(i=1;i<k-2;i++)for(j=b[i];j<10000001;j++){
    d[j]=min(d[j],d[j-b[i]]+1);
  }
 while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

C++: #include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);

int dp[1000000] = {};
int dp_o[1000000] = {};
vector<int>n, n_o;
int DP(int num) {
	if (dp[num] != 0)return dp[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 0;
	while (1) {
		rec = min(DP(n[cnt]) + DP(num - n[cnt]), rec);
		cnt++;
		if (n[cnt] > num)break;
	}
	dp[num] = rec;
	return rec;

}
int DP_o(int num) {
	if (dp_o[num] != 0)return dp_o[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 0;
	while (1) {
		rec = min(DP_o(n_o[cnt]) + DP_o(num - n_o[cnt]), rec);
		cnt++;
		if (n_o[cnt] > num)break;
	}
	dp_o[num] = rec;
	return rec;

}

int main() {
	cin.sync_with_stdio(false);
	ll cnt1 = 0, cnt2 = 0;
	reps(i, 1, 1000000) {
		cnt1 += i;
		cnt2 += cnt1;
		if (cnt2 >= 1000000)break;
		dp[cnt2] = 1;
		n.push_back(cnt2);
		if (cnt2 % 2 == 1) {
			dp_o[cnt2] = 1;
			n_o.push_back(cnt2);
		}
	}
	vector<int>ans;
	while (1) {
		int Q;
		cin >> Q;
		if (Q == 0)break;
		ans.push_back(DP(Q));
		ans.push_back(DP_o(Q));
	}
	rep(i, ans.size())cout << ans[i++] << " " << ans[i] << endl;


	return 0;
}