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;

#define rep(i,n) for(int i=0;i<n;++i)
#define Rep(i,n) for(int i=1;i<=n;++i)
#define rrep(i,n) for(int i=n-1;0<=i;--i)
#define rRep(i,n) for(int i=n;0<i;--i)
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define EPS 1e-8
#define INF 1e8

typedef double Real;
typedef int Int;
typedef vector<Int> vi;
typedef vector<vector<Int> > vvi;
typedef pair<Int,Int> pii;

inline Real sr(Real a) {return sqrt(max(a, (Real)0));}
const vi dy = {-1, 0, 1, 0}, dx = {0, -1, 0, 1};

template <typename K, typename V> ostream& operator<< (ostream& out, const pair<K, V>& p) {
  out << '(' << p.first << ", " << p.second << ')';
  return out;
}

template <typename T> ostream& operator<< (ostream& out, const vector<T>& v) {
  out << '[';
  rep(i, v.size()) out << v[i] << ",";
  out << "\b], " << v.size();
  return out;
}

vi tetrahedralNums;

inline int calcTetrahedralNum(int N){
  return N * (N + 1) * (N + 2) / 6;
}

int M = 183;

void solve(){
  int N, ansA, ansB;
  tetrahedralNums.resize(M);
  rep(i, M) tetrahedralNums[i] = calcTetrahedralNum(i+1);

  vi dp1(1e6+1, INF), dp2(1e6+1, INF);
  dp1[0] = 0;
  rep(i, M){
    int m = tetrahedralNums[i];
    for(int j = m; j <= 1e6; j++)
      if(dp1[j] > dp1[j - m] + 1)
          dp1[j] = dp1[j - m] + 1;
  }

  dp2[0] = 0;
  rep(i, M){
    if(tetrahedralNums[i] % 2 == 0) continue;
    int m = tetrahedralNums[i];
    for(int j = m; j <= 1e6; j++)
      if(dp2[j] > dp2[j - m] + 1)
          dp2[j] = dp2[j - m] + 1;
  }

  while(cin >> N && N){
    cout << dp1[N] << ' ' << dp2[N] << endl;
  }
}

signed main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(9);

  solve();

  return 0;
}

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

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }
    ////
    int dp[100000];
    //fill(dp,dp + x+1,100000);
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count;j++){
	if(i+coin[j]<=x){
	  dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	}
      }
    }
/*
    cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	}
      }
    }
   
    cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
#include<string>
#include<cstdio>
#include<queue>
#include<functional>
#include<tuple>
#include<iomanip>
#include<stack>
#include<cmath>
#define ll long long
#define INF 1000000007
#define N 1000000
using namespace std;
int main() {
	int x = 2,dp[N+1],odddp[N+1];
	dp[0] = odddp[0] = 0;
	for (int i = 1; i <= N; ++i) dp[i] = odddp[i] = i;
	while (1) {
		int y = x * (x + 1)*(x + 2) / 6;
		if (y > N) break;
		for (int i = 0; i + y <= N; ++i) 
			dp[i + y] = min(dp[i + y], dp[i] + 1);
		if (y % 2)
			for (int i = 0; i + y <= N; ++i)
				odddp[i + y] = min(odddp[i + y], odddp[i] + 1);
		++x;
	}
	int n;
	while (cin >> n , n) {
		cout << dp[n] << " " << odddp[n] << endl;
	}
	return 0;
}

C++: #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <iomanip>

#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

const int INF = 1e15;
const int MOD = 1e9+7;

signed main(){
    vector<int> s3;
    rep(i, 1e6){
        if(i == 0){
            s3.push_back(0);
            continue;
        }
        s3.push_back(s3[i-1] + i);
        if(s3[i] >= 1e6){
            break;
        }
    }


    vector<int> s4;
    for(int i = 0; s3[i] < 1e6; i++){
        if(i == 0){
            s4.push_back(0);
            continue;
        }
        s4.push_back(s4[i-1] + s3[i]);
        if(s4[i] > 1e6){
            break;
        }
    }

    int n = (int)s4.size();
    vector<int> dp1(1e6, INF);
    dp1[0] = 0;
    for(int i = 1; i < n; i++){
        rep(j, 1e6){
            if(j + s4[i] >= 1e6 || dp1[j] == INF){
                continue;
            }
            dp1[j + s4[i]] = min(dp1[j + s4[i]], dp1[j] + 1);
        }
    }

    vector<int> dp2(1e6, INF);
    dp2[0] = 0;
    for(int i = 1; i < n; i++){
        if(s4[i] % 2 == 0){
            continue;
        }
        rep(j, 1e6){
            if(j + s4[i] >= 1e6 || dp2[j] == INF){
                continue;
            }
            dp2[j + s4[i]] = min(dp2[j + s4[i]], dp2[j] + 1);
        }
    }

    while(true){
        int x;
        cin >> x;

        if(x == 0){
            break;
        }
        cout << dp1[x] << " " << dp2[x] << endl;
    }

    return 0;
}