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 <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>

using namespace std;

#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define mp(a,b) make_pair((a),(b))
#define eq ==

typedef long long ll;
typedef complex<double> point;
typedef pair<int,int> pii;

// →↑←↓
const int dx[] = {1,0,-1,0};
const int dy[] = {0,-1,0,1};


const double EPS = 1e-9;

struct State{
    int lower,size,rest;
    State(int lower,int size,int rest) : lower(lower),size(size),rest(rest) {};
};

int main(){
    while(true){
        int n;
        cin >> n;
        if(n == 0) break;
        vector<int> v;
        vector<int> odd;
        for(int i=1;;i++){
            int c = i*(i+1)*(i+2)/6;
            if(c > 1000000) break;
            v.push_back(c);
            if(c % 2 == 1) odd.push_back(c);
        }
        queue<State> que;
        que.push(State(0,0,n));
        int ret;
        while(!que.empty()){
            State s = que.front();
            que.pop();
            if(s.rest == 0){
                ret = s.size;
                break;
            }
            for(int i=s.lower;v[i] <= s.rest;i++){
                que.push(State(i,s.size+1,s.rest-v[i]));
            }
        }
        int oret;
        que = queue<State>();
        que.push(State(0,0,n));
        while(!que.empty()){
            State s = que.front();
            que.pop();
            if(s.rest == 0){
                oret = s.size;
                break;
            }
            for(int i=s.lower;odd[i] <= s.rest;i++){
                que.push(State(i,s.size+1,s.rest-odd[i]));
            }
        }
        cout << ret << " " << oret << endl;
    }
    return 0;
}

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

//#define int int64_t
#define REP(i, s, n) for (signed i = (s); i < signed(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) begin(c), end(c)


#define maxup(ans, x) (ans = (ans < x ? x : ans))
#define minup(ans, x) (ans = (ans > x ? x : ans))

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

signed main() {
	const int NM = 1e6;
	vector<int> seisi, dp(NM, 1 << 29), dp2(NM, 1 << 29);
	for (int i = 1; i * (i + 1) * (i + 2) / 6 < NM; i++) {
		int x = i * (i + 1) * (i + 2) / 6;
		seisi.push_back(x);
	}
	dp2[0] = dp[0] = 0;
	rep(i, NM) {
		for (auto x : seisi) {
			if (i - x < 0) break;
			dp[i] = min(dp[i], dp[i - x] + 1);
			if (x % 2) dp2[i] = min(dp2[i], dp2[i - x] + 1);
		}
	}

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

C++: #include <iostream>

using namespace std;

int main() {
	int N;
	int v[200];
        int dpA[1000000], dpB[1000000];
	for (int i = 0; i<=200; i++) v[i] = i * (i + 1)*(i + 2) / 6;
	dpA[0] = dpB[0] = 0;
	for (int i = 1; i<1000000; i++) {
		dpA[i] = dpB[i] = i;
		for (int j = 0; i - v[j] >= 0; j++) {
			dpA[i] = min(dpA[i], dpA[i - v[j]] + 1);
			if (v[j] % 2 == 1)
				dpB[i] = min(dpB[i], dpB[i - v[j]] + 1);
		}
	}
	while (cin >> N, N)
		cout << dpA[N] << " " << dpB[N] << endl;
}

C++: #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

ll odd[1010101];
ll al[1010101];

int main(){
	rep(i,1e6+1){
		al[i] = inf;
		odd[i] = inf;
	}
	al[0] = 0;
	odd[0] = 0;
	REP(i,1,200){
		rep(j,1e6){
			ll t = i*(i+1)*(i+2)/6;
			if(t+j > 1e6) break;
			if(t & 1) chmin(odd[t+j], odd[j]+1);
			chmin(al[t+j],al[j]+1);
		}
	}
	while(1){
		ll n; cin >> n;
		if(!n) break;
		print2(al[n], odd[n]);
	}
}