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 <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
vector<int> pol;
vector<int> pol_odd;
set<int> s;
int dp1[1000100],dp2[1000100];
int dfs1(int k)
{
	if(dp1[k]!=-1)return dp1[k];
	int res=INF;
	for(int i=0;i<pol.size();i++)
	{
		if(pol[i]>k)break;
		res=min(res,dfs1(k-pol[i])+1);
	}
	return dp1[k]=res;
}
int dfs2(int k)
{
	if(dp2[k]!=-1)return dp2[k];
	int res=INF;
	for(int i=0;i<pol_odd.size();i++)
	{
		if(pol_odd[i]>k)break;
		res=min(res,dfs2(k-pol_odd[i])+1);
	}
	return dp2[k]=res;
}
int main()
{
	memset(dp1,-1,sizeof(dp1));
	memset(dp2,-1,sizeof(dp2));
	dp1[0]=dp2[0]=0;
	s.insert(0);
	for(int i=1;;i++)
	{
		int k=i*(i+1)*(i+2)/6;
		if(k>1000000)break;
		pol.pb(k);
		if(k%2)pol_odd.pb(k);
	}
	while(1)
	{
		int n;
		scanf("%d",&n);
		if(n==0)break;
		printf("%d %d\n",dfs1(n),dfs2(n));
	}
	return 0;
}

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

int main(void){
  
  int i, input, tetras[200] = {0}, ans[100][100] = {{0}, {0}};

  for (i = 1; i <= 180; i++) {
    tetras[i] = i * (i+1) * (i+2) / 6;
  }

  int a = 0;
  while (cin >> input) {
    if (input == 0) break;
    int temp = input;
    int j = 1, min = 1000000000;
    while (tetras[j] <= input) {
      int n = 0;
      int k = j;
      while (input > 0) {
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j++;
      input = temp;
    }
    ans[a][0] = min;
    j = 1, min = 1000000000;
    while (tetras[j] <= input) {
      int n = 0;
      int k = j;
      while (input > 0) {
	if (tetras[k] % 2 == 0) {
	  k--;
	  continue;
	}
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j++;
      input = temp;
    }
    ans[a][1] = min;
    a++;
  }

  int b;
  for (b = 0; b < a; b++) {
    cout << ans[b][0] << ' ' << ans[b][1] << endl;
  }
  
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>

using namespace std;

#define INF 100000000


int main(){
	int table1[201]={};
	vector<int> table2;
	for(int i=1;i<201;i++){
		table1[i-1]=i*(i+1)*(i+2)/6;
		if(table1[i-1]%2!=0){
			table2.push_back(table1[i-1]);
		}
	}
	int count1[1000001];
	int count2[1000001];
	for(int i=0;i<1000001;i++){
		count1[i]=INF;
		count2[i]=INF;
	}
	count1[0]=0;
	count2[0]=0;
	count1[1]=1;
	count2[1]=1;
	for(int i=2;i<1000001;i++){
		for(int j=0;j<201;j++){
			if(table1[j]>i)break;
			count1[i] = min(count1[i],count1[i-table1[j]]+1);
		}
	}
	for(int i=2;i<1000001;i++){
		for(int j=0;j<201;j++){
			if(table2[j]>i)break;
			count2[i] = min(count2[i],count2[i-table2[j]]+1);
		}
	}
	int n;
	while(cin>>n&&n!=0){
		cout << count1[n] << " " << count2[n] << endl;
	}
	return 0;
}

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;
vi table(1000000, INF);
int ans;

void search(int n, int step);
int odd_search(int n);
void make_tetra();
void make_odd_tetra();


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

    Int(n);

    while (n) {
        ans = INF;
        search(n, 0);
        cout << ans;
        cout << " " << odd_search(n) << endl;
        cin >> n;
    }

    return 0;
}


int odd_search(int n)
{
    int ret = INF;
    if (table[n] != INF) {
        return table[n];
    } else {
        Rep(i, n/2+1) {
            ret = min(ret, odd_search(n-i) + odd_search(i));
        }
    }
    table[n] = ret;
    return ret;
}

void search(int n, int step)
{
    if (ans <= step) {
        return;
    } else if (!n) {
        ans = step;
        return ;
    } else if (n < 0) {
        return;
    }
    for (int i = tetra.size()-1; i >= 0; i--) {
        if (n >= tetra[i]) {
            search(n-tetra[i], step+1);
        }
    }
}


void make_tetra()
{
    Rep(i, 181) {
        tetra.pb(i * (i + 1) * (i + 2) /6);
    }
}

void make_odd_tetra()
{
    for (int i : tetra) {
        if (i % 2) {
            table[i] = 1;
        }
    }
}