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<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define INF 1e8
using namespace std;
int n;
int dp[5000001];
int dp2[5000001];

int func(int v){
	if(dp[v]!=INF)return dp[v];
	if(v==0)return 0;
	int cnt=INF;
	int j=1;
	while(j*(j+1)*(j+2)/6<=v)j++;
	j--;
	for(int i=j;i>=1;i--){
		cnt=min(cnt,func(v-i*(i+1)*(i+2)/6));
	}
	return (dp[v]=cnt+1);
}

int func2(int v){
	if(dp2[v]!=INF)return dp2[v];
	if(v==0)return 0;
	int cnt=INF;
	int j=1,i;
	while(j*(j+1)*(j+2)/6<=v)j++;
	j--;
	for(i=j;i>=1;i--){
		if((i*(i+1)*(i+2)/6)%2!=1)continue;
		cnt=min(cnt,func2(v-i*(i+1)*(i+2)/6));
	}
	return (dp2[v]=cnt+1);
}

int main(void){
	for(int i=1;i<=2000000;i++)dp[i]=dp2[i]=INF;
	while(1){
		scanf("%d",&n);
		if(n==0)break;
		printf("%d %d\n",func(n),func2(n));
	}
	return 0;
}

C++: #include <iostream>
#define MAX 1000000
#define INF 1000000000
using namespace std;

int dp1[MAX+1],dp2[MAX+2];

int main(){
    //INFで初期化
    for(int i = 1;i <= MAX;i++){
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1;n * (n + 1) * (n * 2) /6 <= MAX;n++){
        int a = n * (n + 1) * (n + 2) / 6;  //ポロック数の生成
        for(int i = a;i <= MAX;i++)     //正四面体数の個数dp(a以下は必要ない)
            dp1[i] = min(dp1[i],dp1[i-a] + 1);  //更新しないor左側から更新する
        if(a % 2 == 0)continue;     //偶数の時は次のroopへ
        for(int i = a;i <= MAX;i++)     //奇数の正四面体数の個数dp(a以下は必要ない)
            dp2[i] = min(dp2[i],dp2[i-a] + 1);  //更新しないor左側から更新する
    }

    //入出力
    while(true){
        int n;
        cin >> n;
        if(n == 0)break;
        cout << dp1[n] << " " << dp2[n] << endl;
    }

    return 0;
}

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

typedef pair<long long int, long long int> PLL;

vector<long long int>A( 1000001, LLONG_MAX / 6 ), B( 1000001, LLONG_MAX / 6 );

long long int saikiA( long long int N ) {
	if( A[N] == LLONG_MAX / 6 ) {
		for( size_t i = 1; i * 2 <= N; i++ ) {
			A[N] = min( A[N], saikiA( i ) + saikiA( N - i ) );
		}
	}
	return A[N];
}

long long int saikiB( long long int N ) {
	if( B[N] == LLONG_MAX / 6 ) {
		for( size_t i = 1; i * 2 <= N; i++ ) {
			B[N] = min( B[N], saikiB( i ) + saikiB( N - i ) );
		}
	}
	return B[N];
}

int main() {
	vector<long long int>X, Y;
	for( size_t i = 1; i < 100; i++ ) {
		long long int now = i*(i + 1)*(i + 2) / 6;
		A[now] = 1;
		X.emplace_back( now );
		for( auto x : X ) {
			A[now + x] = min( A[now + x], 2LL );
		}
		if( now % 2 ) {
			B[now] = 1;
			Y.emplace_back( now );
			for( auto x : Y ) {
				A[now + x] = min( A[now + x], 2LL );
			}
		}
	}
	long long int N;
	while( cin >> N, N ) {
		cout << saikiA( N ) << " " << saikiB( N ) << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##_len=(int)(n);i<i##_len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define REPW(i,n) for(i=0;i<(int)(n);++i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)   // c++14
#define SZ(c) ((int)c.size())
#define EXIST(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : " "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
    }
} before_main_function;
//------------------------------------------------------------------------------

int tetr[200];
int dp1[1234567];
int dp2[1234567];
signed main() {
    REP(i,200) tetr[i]=(i+1)*(i+2)*(i+3)/6;
    REP(i,1000010) {
        dp1[i]=i;
        dp2[i]=i;
    }
    REP(i,200) {
        REP(j,1000010) {
            if(dp1[j]!=INF) {
                if(j+tetr[i]<=1000010) chmin(dp1[j+tetr[i]],dp1[j]+1);
            }
            if(tetr[i]%2==0) {
                continue;
            }
            if(dp2[j]!=INF) {
                if(j+tetr[i]<=1000010) chmin(dp2[j+tetr[i]],dp2[j]+1);
            }
        }
    }
    while(1) {
        int n;
        cin>>n;
        if(n==0) break;
        cout<<dp1[n]<<" "<<dp2[n]<<endl;
    }
    return 0;
}