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<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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

int n = 0;



void input() {
	CI n;
}


void proce_odd() {
	vector<int> tetra;
	int num = 1;

	int i = 0;
	int remain = 0;
	int maxx = 0;

	while (true) {

		if (i * (i + 1) * (i + 2) / 6 > n && (i * (i + 1) * (i + 2) / 6) % 2 == 1) {
			i--;
			auto ite = tetra.end();
			ite--;
			maxx = *ite;
			break;
		}
		if ((i * (i + 1) * (i + 2) / 6) % 2 == 1) {
			tetra.push_back(i * (i + 1) * (i + 2) / 6);
		}
		i++;
	}

	remain = n - maxx;
	vector<int>::iterator it_end = tetra.end();
	vector<int>::iterator it_last = tetra.end();
	--it_end;

	int num_min = 1000001;
	while (1) {
		while (remain > 0) {
			num++;
			++it_end;
			it_end = upper_bound(tetra.begin(), it_end, remain);
			--it_end;

			remain -= *it_end;
		}
		if (num_min > num) {
			num_min = num;
		}
		num = 1;
		remain = n - *--it_last;
		if (remain == n - 1)break;
		it_end = it_last;
	}

	CO num_min E;

}

void proce() {
	vector<int> tetra;
	int num = 1;

	int i = 0;
	int remain = 0;
	int maxx = 0;

	while (true) {

		if (i * (i + 1) * (i + 2) / 6 > n) {
			i--;
			maxx = i * (i + 1) * (i + 2) / 6;
			break;
		}
		tetra.push_back(i * (i + 1) * (i + 2) / 6);
		i++;
	}

	remain = n - maxx;
	vector<int>::iterator it_end = tetra.end();
	vector<int>::iterator it_last = tetra.end();
	--it_end;

	int num_min = 1000001;
	while (1) {
		while (remain > 0) {
			num++;
			++it_end;
			it_end = upper_bound(tetra.begin(), it_end, remain);
			--it_end;

			remain -= *it_end;
		}
		if (num_min > num) {
			num_min = num;
		}
		num = 1;
		remain = n - *--it_last;
		if (remain == n - 1)break;
		it_end = it_last;
	}

	CO num_min;


}

int main(void) {
	while (true) {
		input();
		if (n == 0)break;

		proce();

		CO ' ';

		proce_odd();
	}

	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

int mint[1000000], mink[1000000];
int main() {
	for (int i = 1;; i++) {
		int a = i*(i + 1)*(i + 2) / 6;
		if (a >= 1000000)break;
		for (int j = a; j < 1000000; j++) {
			mint[j] = min(mint[j], mint[j - a] + 1);
			if (a & 1)mink[j] = min(mink[j], mink[j - a] + 1);
		}
	}
	int n;
	while (scanf("%d", &n), n)
		printf("%d %d\n", mint[n], mink[n]);
}

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

#define LIM 1000000
int all[LIM];
int odd[LIM];

int main()
{
    for (int i = 0; i < LIM; i++){
        all[i] = i;
        odd[i] = i;
    }
    for (int i = 0; i < LIM; i++){
        int x = i * (i + 1) * (i + 2) / 6;
        if (x > LIM) break;
        for (int j = x; j <= LIM; ++j){
            all[j] = min(all[j], all[j-x] + 1);
        }
        if (x % 2 == 1){
            for (int j = x; j <= LIM; ++j){
                odd[j] = min(odd[j], odd[j-x] + 1);
            }
        }
    }

    int n;
    while (true) {
        cin >> n;
        if (n == 0) break;
        cout << all[n] << " " << odd[n] << endl;
    }

    return 0;
}

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

int pol(int n){
    return n*(n+1)*(n+2)/6;
}

int main(){
    vector<int> any(1000001),odd(1000001);
    for(int i=1;i<=1000000;i++){
        any[i]=odd[i]=i;
    }
    for(int n=2;pol(n)<=1000000;n++){
        int p = pol(n);
        for(int i=0;i+p<=1000000;i++){
            any[p+i]=min(any[p+i],any[i]+1);
        }
    }
    for(int n=2;pol(n)<=1000000;n++){
        int p = pol(n);
        if(p%2==0) continue;
        for(int i=0;i+p<=1000000;i++){
            odd[p+i]=min(odd[p+i],odd[i]+1);
        }
    }
    int n;
    while(cin>>n,n){
        cout<<any[n]<<' '<<odd[n]<<endl;
    }

    return 0;
}

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

int dp[1000000],kisuu[1000000];
int main(){
    fill(dp,dp+1000000,1<<29);
    fill(kisuu,kisuu+1000000,1<<29);
    dp[0]=0;
    kisuu[0]=0;
    for(int i=1;i<500;i++){
	int s=i*(i+1)*(i+2)/6;
	    for(int j=s;j<1000000;j++){
	    dp[j]=min(dp[j],dp[j-s]+1);
	    }
	    if((s&1)==0)continue;
	    for(int j=s;j<1000000;j++){
	    kisuu[j]=min(kisuu[j],kisuu[j-s]+1);
	    }
	}
	int k;
	while(cin>>k,k){
	    cout<<dp[k]<<" "<<kisuu[k]<<endl;
	    }
    }