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 <cstdio>
using namespace std;

int coin[100000];
int coin_ki[100000];
int dp[100000];
int dp2[100000];

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

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    int ans_tmp=0;
    int ans2_tmp=0;

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


    int ans1=dp[x];

    
    
    for(int i=0;i<100000;i++)
      dp2[i]=100000;


    

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

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


    printf("%d %d\n",ans1,ans2);
  }
  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, odd_tetra;
vi table(1000001, INF), dp(1000001, INF);

void make_tetra();
void make_odd_tetra();


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

    Int(n);

    while (n) {
        cout << dp[n] << " " << table[n] << endl;
        cin >> n;
    }

    return 0;
}


void make_tetra()
{
    Rep(i, 181) {
        tetra.pb(i * (i + 1) * (i + 2) /6);
    }
    dp[0] = 0;
    Rep(x, 1000000) {
        int ret = INF;
        for (int i : tetra) {
            if (x < i) {
                break;
            } else {
                ret = min(ret, dp[x - i] + 1);
            }
        }
        dp[x] = ret;
    }
}

void make_odd_tetra()
{
    for (int i : tetra) {
        if (i % 2) {
            odd_tetra.pb(i);
            table[i] = 1;
        }
    }
    table[0] = 0;
    Rep(x, 1000000) {
        int ret = INF;
        for (int i : odd_tetra) {
            if (x < i) {
                break;
            } else {
                ret = min(ret, table[x - i] + 1);
            }
        }
        table[x] = ret;
    }
}

C++: #include <stdio.h>
#define INF 0x7FFFFFFF

int main(void){
	int i, j, n, min1,small;
	int dp[1000000];
	scanf("%d",&n);
	while(n != 0){
		for(i = 0;i <= n;i++)
			dp[i] = INF;
		dp[0] = 0;
		small = INF;
		for(i = 0;i < n;i++){
			if(dp[i] < small){
				for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
					if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1)
						dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
				}
			}
			if(small > dp[n])
				small = dp[n];
		}

		min1 = dp[n];
		for(i = 0;i <= n;i++)
			dp[i] = INF;
		dp[0] = 0;
		small = INF;
		for(i = 0;i < n;i++){
			if(dp[i] < small){
				for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
					if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1 && j * (j + 1) * (j + 2) / 6 % 2 == 1)
						dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
				}
			}
			if(small > dp[n])
				small = dp[n];
		}
		printf("%d %d\n",min1,dp[n]);
		scanf("%d",&n);
	}
	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < n;i++)
#define repb(i, n) for(int i = n;i >= 0;i--)
#define reps(i, m, n) for(int i = m;i < n;i++)
#define repsb(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long ll;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
using namespace std;

#define N 1000000

int fa[N];
int sa[N];
void cal(void){
 int cl;
 fa[0]=0;
 sa[0]=0;
 reps(i,1,N){
   fa[i]=sa[i]=i;
   reps(j,1,INF){
     cl=j*(j+1)*(j+2)/6;
     if(cl>i) break;
     fa[i]=min(fa[i],fa[i-cl]+1);
     if(cl&1)  sa[i]=min(sa[i],sa[i-cl]+1);
   }
 }
}
int main(int argc, char const *argv[]) {
 cal();
 int t;
 while (true) {
   cin>>t;
   if(t==0)  break;
   printf("%d %d\n",fa[t],sa[t] );
 }
 return 0;
}