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++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167&lang=jp

#include<iostream>
#include<fstream>

#define Max_Len 1000000

using namespace std;

int triCalc(int num){
	static int count[Max_Len];
	static int triangle[Max_Len];
	static bool f = true;
	if (f){//初期化
		for (int i = 0; i < Max_Len; i++)
			count[i] = triangle[i] = Max_Len;
		f = false;
	}
	int triNum;

	int i = 1;
	while (i * (i + 1) * (i + 2) / 6 <= num)i++;
	i--;
	triNum = i * (i + 1) * (i + 2) / 6;

	if (triNum == num)return 1;
	while (num / 5 < triNum){
		if (triangle[num - triNum] == Max_Len){
			if (count[num] > triCalc(num - triNum) + 1)
				count[num] = triCalc(num - triNum) + 1;
		}
		else if (count[num] > triangle[num - triNum] + 1)
			count[num] = triangle[num - triNum] + 1;

		i--;
		triNum = i * (i + 1) * (i + 2) / 6;
	}
	return triangle[num] = count[num];
}

int oddCalc(int num){
	static int count[Max_Len];
	static int triangle[Max_Len];
	static bool f = true;
	if (f){//初期化
		for (int i = 0; i < Max_Len; i++)
			count[i] = triangle[i] = Max_Len;
		f = false;
	}

	int triNum;

	int i = 1;
	while (i * (i + 1) * (i + 2) / 6 <= num)i++;
	i--;
	while ((i * (i + 1) * (i + 2) / 6 )% 2 == 0)i--;
	triNum = i * (i + 1) * (i + 2) / 6;

	if (triNum == num)return 1;
	while (i > 0){
		if (triangle[num - triNum] == Max_Len){
			if (count[num] > oddCalc(num - triNum) + 1)
				count[num] = oddCalc(num - triNum) + 1;
		}
		else if (count[num] > triangle[num - triNum] + 1)
			count[num] = triangle[num - triNum] + 1;

		i--;
		while ((i * (i + 1) * (i + 2) / 6) % 2 == 0)i--;
		triNum = i * (i + 1) * (i + 2) / 6;
	}
	return triangle[num] = count[num];
}

int main(){

	ifstream fin;

	fin.open("input.txt");

	int n;

	while (true){
		fin >> n;
		if (n == 0)break;

		cout << triCalc(n) << " " << oddCalc(n) << endl;
	}

	return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
using namespace std;

#define M 1000000

int odd[M + 10], all[M + 10];

void update(int *a, int x){
    for(int i = x; i <= M; ++i){
        a[i] = min(a[i], a[i - x] + 1);
    }
}

int main(){
    for(int i = 1; i <= M; ++i){
        odd[i] = all[i] = 10000000;
    }

    for(int i = 1; ; ++i){
        int x = i * (i + 1) * (i + 2) / 6;
        if(x > M){ break; }
        update(all, x);
        if(x % 2){ update(odd, x); }
    }

    int n;
    while(cin>>n, n){
        printf("%d %d\n", all[n], odd[n]);
    }
}

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 (int i = 1; i <= N; i++) {
		dp[0][i] = 1001000;
	}
	for (int i = 1; i <= N; i++) {
		dpodd[0][i] = 1001000;
	}

	for (long int j = 1; j <= 189; j++) {
		for ( long int i = 1; i <= 1000002; 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 <= 1000002; 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;
}