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>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define MAX 1000000

int calc(int n) { return n*(n + 1)*(n + 2) / 6; }
int p[200];
int p1[200];
int dp[MAX] = { 0 };
int dp1[MAX] = { 0 };

int func(int n, int P[], int DP[])
{
	if (n <= 0)return MAX;
	if (DP[n] != 0)return DP[n];
	else
	{
		int min_t = MAX;
		int i = 0;
		while (1)
		{
			if (P[i] <= n && n <= P[i + 1])break;
			if (P[i] == 1004731)
			{
				i--;
				break;
			}
			i++;
		}
		for (int t = i; t>0; t--)
		{
			int temp = func(n - P[t], P, DP);
			if (min_t > temp + 1)
			{
				min_t = temp + 1;
			}
		}
		DP[n] = min_t;
		return DP[n];
	}
}

int main()
{
	int index = 1;
	FOR(i, 1, 200)
	{
		int temp = calc(i);
		if (temp > 1004731)break;
		p[i] = temp;
		dp[p[i]] = 1;
		if (temp % 2 == 1)
		{
			p1[index] = temp;
			dp1[p1[index]] = 1;
			index++;
		}
	}
	while (1)
	{
		int N;
		cin >> N;
		if (N == 0)return 0;
		cout << func(N, p, dp) << " " << func(N, p1, dp1) << endl;
	}
}

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

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

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    for(int i=1;i<=x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)
	break;
      count++;
      if(tmp%2==1)
	count_ki++;
    }

    int coin[count];
    int coin_ki[count_ki];
    int tmp2=0;
  
    for(int i=1;i<count+1;i++){
      coin[i-1]=i*(i+1)*(i+2)/6;
      if(coin[i-1]%2==1)
	coin_ki[tmp2++]=coin[i-1];
    }
  
    //printf("%d\n",count_ki);

    /*for(int i=0;i<count_ki;i++){
      printf("coin[%d]=%d\n",i,coin_ki[i]);
      }*/

    int dp[x+1];
    fill(dp,dp + x + 1,100000);
  

    /*for(int i=0;i<=x;i++)
      printf("dp[%d]=%d\n",i,dp[i]);
    */
    dp[0]=0;
    for(int i = 0;i<x+1;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);
  
    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x+1;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;
  
    ///*/
  }
}

C++: #include <bits/stdc++.h>

using namespace std;

using i64 = long long;

const i64 MOD = 1000003;
const i64 INF = i64(1e18) + 7;


template <typename T>
bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}


signed main(){
    vector<int> s{1};
    for(int i = 2; s.back() <= 1e6; ++i){
        s.push_back(s.back() + i);
    }
    vector<i64> v{1};
    for(int i = 1; v.back() <= 1e6; ++i)
        v.push_back(v.back() + s[i]);
    s.clear();
    int m = 1e6 + 7;
    vector<int> dist(m, MOD), dist2(m, MOD);
    queue<int> que;
    que.emplace(0);
    dist[0] = 0;
    while(!que.empty()){
        int k = que.front();
        que.pop();
        for(auto x : v)
            if(k + x < m && chmin(dist[k + x], dist[k] + 1))
                que.emplace(k + x);
    }
    que.emplace(0);
    dist2[0] = 0;
    while(!que.empty()){
        int k = que.front();
        que.pop();
        for(auto x : v)
            if(x % 2 == 1 && k + x < m && chmin(dist2[k + x], dist2[k] + 1))
                que.emplace(k + x);
    }
    while(1){
        int k;
        cin >> k;
        if(!k)
            break;
        cout << dist[k] << " " << dist2[k] << endl;
    }
}

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

int main(){
	int num[1000010];
	int num2[1000010];
	vector<int> v;
	for(int i=0; i< 100000; i++){
		int m = i*(i+1)*(i+2)/6;
		if(1000000 <= m) break;
		v.push_back(m);
	}
	for(int i=0; i< 1000010; i++) num[i] = 10e8;
	for(int i=0; i< 1000010; i++) num2[i] = 10e8;
	num[0] = 0;
	num2[0] = 0;
	for(int j=0; j< 1000010; j++){
		for(int i=0; i < v.size(); i++){
			int m = i*(i+1)*(i+2)/6;
			if(1000010 <= m+j) continue;
			num[j+m] = min(num[j]+1, num[j+m]);

			if(m == 0) continue;
			if(m%2 == 0) continue;
			num2[j+m] = min(num2[j]+1, num2[j+m]);
		}
	}
	int n;
	while(cin >> n, n){
		cout << num[n] << " " << num2[n] << endl;
	}
}