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 INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define mp make_pair
#define i_i pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< i_i >
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; scanf("%lld", &x);
 
//int dxy[5] = {0, 1, 0, -1, 0};
// assign

vi tetra, odd_tetra;
vi table(1000001, INF), dp(1000001, INF);

void make_tetra();
void make_odd_tetra();


signed main()
{
    make_tetra();
    make_odd_tetra();

    Int(n);

    while (n) {
        cout << dp[n] << " " << table[n] << endl;
        cin >> n;
    }

    return 0;
}


void make_tetra()
{
    Rep(i, 181) {
        tetra.pb(i * (i + 1) * (i + 2) /6);
    }
    dp[0] = 0;
    Rep(x, 1000000) {
        int ret = INF;
        for (int i : tetra) {
            if (x < i) {
                break;
            } else {
                ret = min(ret, dp[x - i] + 1);
            }
        }
        dp[x] = ret;
    }
}

void make_odd_tetra()
{
    for (int i : tetra) {
        if (i % 2) {
            odd_tetra.pb(i);
            table[i] = 1;
        }
    }
    table[0] = 0;
    Rep(x, 1000000) {
        int ret = INF;
        for (int i : odd_tetra) {
            if (x < i) {
                break;
            } else {
                ret = min(ret, table[x - i] + 1);
            }
        }
        table[x] = ret;
    }
}

C++: #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)

typedef long long ll;

#define N 1000000

int x[1000001]={} , y[1000001]={};

int main(void) {
    vector<int> a,b;
    int i=1;
    while (i*(i+1)*(i+2)/6<=N){
        int f = i*(i+1)*(i+2)/6;
        a.push_back(f);
        if (f%2==1)
            b.push_back(f);
        i++;
    }
    int n = a.size() , m = b.size();
    FOR(i,1,N){
        x[i] = N;
        y[i] = N;
    }
    FOR(i,0,n){
        REP(j,n){
            if (i+a[j]>N)
                break;
            x[i+a[j]] = min(x[i+a[j]],x[i]+1);
        }
        REP(j,m){
            if (i+b[j]>N)
                break;
            y[i+b[j]] = min(y[i+b[j]],y[i]+1);
        }
    }
    while (cin >> n && n){
        cout << x[n] << " " << y[n] << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main() {
    vector<int> dp(1000001, 1e9);
    vector<int> dp2(1000001, 1e9);
    dp[0] = dp2[0] = 0;
    for(int i=1; i*(i+1)*(i+2)/6 <= 1000000; ++i) {
        int l = i*(i+1)*(i+2)/6;
        for(int j=0; j+l<=1000000; ++j) {
            dp[j+l] = min(dp[j+l], dp[j] + 1);
        }
        if(l % 2 == 1) {
            for(int j=0; j+l<=1000000; ++j) {
                dp2[j+l] = min(dp2[j+l], dp2[j] + 1);
            }
        }
    }


    int n;
    while(cin >> n, n) {
        cout << dp[n] << " " << dp2[n] << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;

int f[190];
int dp1[1000100];
int dp2[1000100];


void solve(){

    int n=182;
    vector<int> v;

    while(true){
        int x;
        cin >> x;
        if(x==0) break;
        v.emplace_back(x);
    }


    rep(i,190){
        f[i]=i*(i+1)*(i+2)/6;
    }

    rep(i,1000100){
        dp1[i]=i;
        dp2[i]=i;
    }


    for(int k=1; k<=1000100; k++){
        rep(i,n){
            if(k>=f[i]) dp1[k]=min(dp1[k-f[i]]+1, dp1[k]);
            if(f[i]%2==1){
                if(k>=f[i]) dp2[k]=min(dp2[k-f[i]]+1, dp2[k]);
            }
        }
        /*
        rep(i,100){
            if(k>=fodd[i]) dp2[k]=min(dp2[k-fodd[i]]+1, dp2[k]);
        }
        */
    }


    rep(i,v.size()){
        cout << dp1[v[i]] << " " << dp2[v[i]] << endl;
    }


}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}