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 <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[1000];//正四面体数
vector<ll>v;
ll dp[1000000],dp2[1000000];
int main() {
	v.pb(1);
	ll n,now=1;
	rep(i, 1000) {
		ss[i] = (ll)i*(i + 1)*(i + 2) / 6;
		if (ss[i] % 2 == 1)v.pb(ss[i]);
	}
	rep(i, 100000) {
		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], i / ss[j] + dp[i%ss[j]]);
	}
	now = 1;
	rep(i, 100000) {
		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], i / v[j] + dp2[i%v[j]]);
	
	}
	while (cin >> n, n) {
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int d[1<<21],e[1<<21],x[1<<21],y[1<<21];
main(){
  for(int i=0;i<1<<20;++i)d[i]=e[i]=i;
  
  for(int i=1,j=1;i<300;++i){
    x[i]=i*(i+1)*(i+2)/6,d[x[i]]=1;
    if(x[i]%2)y[j]=x[i],e[y[j++]]=1;
  }
  
  for(int i=1;i<1000001;++i)
    for(int j=1;i+x[j]<300;++j){
      d[i+x[j]]=min(d[i+x[j]],d[i]+1);
    }
  for(int i=1;i<1000001;++i)
    for(int j=1;i+y[j]<300;++j){
      e[i+y[j]]=min(e[i+y[j]],e[i]+1);
    }
  int n;
  while(cin>>n,n){
    cout<<d[n]<<' '<<e[n]<<endl;
  }
}

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

vector<int> table;
vector<int> otable;

static const int MAX = 1000000;
int memo[MAX];
int omemo[MAX];

int tri(int N) {
  //printf("N = %d\n", N);
  if (N == 0) {
    return 0;
  }
  int mn = MAX;
  if (memo[N] < 0) {
    for (int i = 0; N - table[i] >= 0; i++) {
      mn = min(mn, tri(N - table[i]) + 1);
    }
    memo[N] = mn;
  }
  return memo[N];
}

int otri(int N) {
  //printf("N = %d\n", N);
  if (N == 0) {
    return 0;
  }
  int mn = MAX;
  if (omemo[N] < 0) {
    for (int i = 0; N - otable[i] >= 0; i++) {
      mn = min(mn, otri(N - otable[i]) + 1);
    }
    omemo[N] = mn;
    return mn;
  }
  return omemo[N];
}

int main()
{
  int N;
  for (int i = 1; i * (i + 1) * (i + 2) / 6 <= MAX; i++) {
    table.push_back(i * (i + 1) * (i + 2) / 6);
    if ((i * (i + 1) * (i + 2) / 6) % 2 == 1) {
      otable.push_back(i * (i + 1) * (i + 2) / 6);
    }
  }

  fill(memo, &memo[MAX], -1);
  fill(omemo, &omemo[MAX], -1);
  
  while (scanf("%d ", &N) == 1) {
    if (N == 0) {
      break;
    }
    //printf("%d\n", N);
    //printf("\ntri:\n");
    printf("%d ", tri(N));
    //printf("\notri:\n");
    printf("%d\n", otri(N));
  }
}

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

const int limit = 200;
int tetra[limit];
int odd[limit];
int ans(int n, int index, int *a) {
    if(n < a[1] || index==0) return n;
    int i;
    for(i=index; i>0; --i) {
        if(a[i]<=n) break;
    }
    return min(1+ans(n-a[i], i, a), ans(n, i-1, a));
}

int main(void){
    int size = 0;
    int inf = numeric_limits<int>::max();
    rep(i, limit) odd[i] = inf;
    for(int i=1; i<limit+1; ++i) {
        ll t = i*(i+1)*(i+2)/6;
        tetra[i-1] = t;
        if(t%2==1) {odd[size]=t; size++;}
    }
    int n;
    while(cin >> n && n) {
        cout << ans(n, limit-1, tetra) << " ";
        cout << ans(n, limit-1, odd) << endl;
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265

int c[300];
vector<int> d;
int a[10000000],b[10000000];

void f(int n){

  int j=1;
  FOR(i,1,n+1){
    if(c[j+1]==i){
      a[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,1,300){
        if(i/c[k]==0) break;
        res = min(res,(i/c[k])+a[i%c[k]]);
      }
      a[i] = res;
    }
  }


  j = 1;
  FOR(i,1,n+1){
    if(d[j+1]==i){
      b[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,1,d.size()){
        if(i/d[k]==0) break;
        res = min(res,(i/d[k])+b[i%d[k]]);
      }
      b[i] =res;
    }
  
  }




}

void g(int n){
  cout<<a[n]<<' '<<b[n]<<endl;
}


int main(){
  d.push_back(0);
  for(int i=1;i<200;i++){
    c[i] = (i*(i+1)*(i+2))/6;
   if(c[i]%2){
     d.push_back(c[i]);
   }
  }

  f(1000000);

  while(1){
    int n;
    cin>>n;
    if(n==0) break;
    g(n);
  }

  return 0;
}