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 <vector>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < n ; i++)

int dp[1000001] , dp2[1000001];

vector<int> item;

int main(){
	int n;
	for(int i = 1 ; i * (i+1) * (i+2) / 6 <= 1000000 ; i++) item.push_back(i * (i+1) * (i+2) / 6);
	rep(i,1000001) dp[i] = 9999;
	rep(i,1000001) dp2[i]= 9999;
	dp[0] = dp2[0] = 0;

	for(int i = 0 ; i <= 1000000 ; i++){
		for(int j = 0 ; j < item.size() && item[j]+i <= 1000000 ; j++){
			dp[i + item[j]] = min(dp[i + item[j]] , dp[i] + 1);
		}
	}
	for(int i = 0 ; i <= 1000000 ; i++){
		for(int j = 0 ; j < item.size() && item[j]+i <= 1000000 ; j++){
			if(item[j] % 2) dp2[i + item[j]] = min(dp2[i + item[j]] , dp2[i] + 1);
		}
	}
	
	while(cin >> n && n){
		cout << dp[n] << " " << dp2[n] << endl;
	}
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[190]={0},b[50]={0},c[100001]={0,1,2,3},d[100001],k=0,i,j,n;

  for(i=1;i<190;i++)a[k++]=i*(i+1)*(i+2)/6;

  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];

  for(i=1;i<70;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;

  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-1;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;

  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int i;
    int n;
    int j = 0;
    int a[84];
    int b[22];
    int t[10000];
    for(i = 0; i < 83; i++){
        a[i] = (i+1)*(i+2)*(i+3)/6;
        if(a[i] % 2 == 1){
            b[j] = a[i];
            j++;
        }
    }
    /*for(i = 0; i < 83; i++){
        cout << "a[i] = " << a[i] << endl;
    }
    for(i = 0; i < 21; i++){
        cout << "b[i] = " << b[i] << endl;
    }*/
    while(1){
        cin >> n;
        if(n == 0){
            break;
        }
        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 82; i++){
            for(j = a[i]; j <= n; j++){
                if(t[j] > t[j - a[i]] + 1){
                    t[j] = t[j -a[i]] + 1;
                }
            }
        }
        cout << t[n] << " ";

        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 20; i++){
            for(j = b[i]; j <= n; j++){
                if(t[j] > t[j - b[i]] + 1){
                    t[j] = t[j - b[i]] + 1;
                }
            }
        }
        cout << t[n] << endl;
    }
    return 0;
}