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<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int mod = 1e9 + 7;
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int table[3000001];
int main() {
    cin.tie(0); ios::sync_with_stdio(false);
    int tetra[201];
    tetra[0] = 0;
    rrep(i, 1, 201) tetra[i] = i * (i + 1) * (i + 2) / 6;
    int dp[1000001];
    rep(i, 1000001) dp[i] = i;
    int dp2[1000001];
    rep(i, 1000001) dp2[i] = i;
    rep(i, 201) {
        rep(j, 1000001) {
            if (j + tetra[i] < 1000001) {
                chmin(dp[j + tetra[i]], dp[j] + 1);
                if (tetra[i] % 2 != 0) chmin(dp2[j + tetra[i]], dp2[j] + 1);
            }
        }
    }
    int n;
    while (cin >> n && n) {
        cout << dp[n] << " " << dp2[n] << endl;
    }
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#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 };


long int dp[190][1000010] = { 0 };
long int dpodd[190][1000010] = { 0 };


long int N = 0;
long int C[191];
long int Codd[51];

void input(void) {
	CI N;

	return;
}


int main(void) {
	long int C_N;
	for (int i = 1; i <= 190;i++) {
		C[i - 1] = i * (i + 1) * (i + 2) / 6;
	}
	long int ii = 1, jj = 0;
	while (true) {
		if (ii * (ii + 1) * (ii + 2) / 6 > 1000000) {
			break;
		}
		if ((ii * (ii + 1) * (ii + 2) / 6) % 2 == 1) {
			Codd[jj] = ii * (ii + 1) * (ii + 2) / 6;
			jj++;
		}
		ii++;
	}

	for (long int i = 1; i <= N; i++) {
		dp[0][i] = 1001000;
	}
	for (long int i = 1; i <= N; i++) {
		dpodd[0][i] = 1001000;
	}

	for (long int j = 1; j <= 189; j++) {
		for ( long int i = 1; i <= 1002; i++) {
			/*if (i < C[j - 1]) {
				dp[j][i] = dp[j - 1][i];
			}
			else {
				dp[j][i] = min(dp[j - 1][i], dp[j][i - C[j - 1]] + 1);
			}*/
		}
	}

	for (long int j = 1; j <= 189; j++) {
		for ( long int i = 1; i <= 1002; i++) {
			/*if (i < Codd[j - 1]) {
				dpodd[j][i] = dpodd[j - 1][i];
			}
			else {
				dpodd[j][i] = min(dpodd[j - 1][i], dpodd[j][i - Codd[j - 1]] + 1);
			}*/
		}
	}

	while (true) {
		input();
		if (N == 0) {
			break;
		}
		for (int i = 0; i < 190; i++) {
			if (C[i] > N) {
				C_N = i;
				break;
			}
		}
	

		

		CO dp[C_N][N] << " ";

		
		for (int i = 0; i < 50; i++) {
			if (Codd[i] > N) {
				C_N = i;
				break;
			}
		}
		

		CO dpodd[C_N][N] E
		
		
	}
	
	
	return 0;
}

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

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,P> PP;

//-----------------------------------------------------------------------------


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int num[185];
	for(int i=1;i<185;i++) {
		num[i-1]=i*(i+1)*(i+2)/6;
	}
	int dp[1000100],dp_odd[1000100];
	REP(i,1000100) dp[i]=dp_odd[i]=INF;
	dp[0]=dp_odd[0]=0;
	REP(i,1000000) {
		if(dp[i]!=INF) {
			REP(j,185) {
				if(num[j]+i>1000000) break;
				dp[i+num[j]]=min(dp[i+num[j]],dp[i]+1);
			}
		}
		if(dp_odd[i]!=INF) {
			REP(j,185) {
				if(num[j]+i>1000000) break;
				if(num[j]%2==0) continue;
				dp_odd[i+num[j]]=min(dp_odd[i+num[j]],dp_odd[i]+1);
			}
		}
	}

	while(true) {
		int n;
		cin>>n;
		if(n==0) break;
		cout<<dp[n]<<' '<<dp_odd[n]<<endl;
	}

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<int> smt(1,0);
  vector<int> ksmt(1,0);
  int a;
  for(int i=1;i<10000;i++){
    a=i*(i+1)*(i+2)/6;
    smt.push_back(a);
    if(a%2==1)ksmt.push_back(a);
    if(a>1000000)break;
    //cout << a << endl;
  }
  while(1){
    //cout <<smt.size()<<" "<<ksmt.size()<<endl;
    int dp[2][1000000]={};
    
    //cout <<"2"<<endl;
    int n;
    cin >> n;
    int m=0,k=1;
    if(n==0)break;
    //
    for(int i=1;i<=n;i++){
      dp[0][i]=i;
    }
    //all
    for(int i=1;i<smt.size();i++){
      if(smt[i]>n){
	cout << dp[m][n]<<" ";
	break;
      }
      for(int j=1;j<=n;j++){
	if(smt[i]>j) dp[k][j]=dp[m][j];
	else{
	  dp[k][j]=min(dp[m][j],dp[k][j-smt[i]]+1);
	}
	//cout <<dp[k][j]<<" ";
      }
      swap(m,k);
    }
    //reset
    for(int i=1;i<=n;i++){
      dp[0][i]=i;
    }
    m=0,k=1;
    //kisuu
    for(int i=1;i<ksmt.size();i++){
      if(ksmt[i]>n){
	cout << dp[m][n]<<endl;
	break;
      }
      for(int j=1;j<=n;j++){
	if(ksmt[i]>j) dp[k][j]=dp[m][j];
	else{
	  dp[k][j]=min(dp[m][j],dp[k][j-ksmt[i]]+1);
	}
      }
      swap(m,k);
    }
  }
  return 0;
}