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<stdio.h>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <functional>
#include <stdio.h>
#include <array>
#include <algorithm>
#include <string>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <queue>
#include<iomanip>
#include<bitset>
#include<stack>
#include<set>
#include<limits>
#include <complex>
using namespace std;


vector<int>nums;
vector<int>oddnums;

vector<short>memo(1000001,-1);
vector<short>oddmemo(1000001,-1);

int getans(const int num,const int atime) {
	if (memo[num] != -1) {
		return memo[num];
	}
	else {
		if (num == 0)return memo[num] = 0;
		if (atime > 10)return atime;
		int ans = num;
		for (int i = 0; i <nums.size(); ++i) {
			int minusnum = nums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 10) {
				continue;
			}
			ans = min(ans, getans(num - minusnum, atime + 1)+1);
		}

		return memo[num] = ans;
	}
}
int getoddans(const int num, const int atime) {
	if (oddmemo[num] != -1) {
		return oddmemo[num];
	}
	else {
		if (num == 0)return oddmemo[num] = 0;
		if (atime > 50)return atime;
		int ans = num;
		for (int i = 0; i < oddnums.size(); ++i) {
			int minusnum = oddnums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 50) {
				continue;
			}
			ans = min(ans, getoddans(num - minusnum, atime + 1) + 1);
		}
		return oddmemo[num] = ans;
	}

}
int main() {
	for (int i = 1; i < 190; ++i) {
		nums.push_back(i*(i + 1)*(i + 2) / 6);
		if (((i*(i + 1)*(i + 2)) / 6) % 2) {

		
			oddnums.push_back((i*(i + 1)*(i + 2)) / 6);
		}
	}

	while (1) {
		int n; cin >> n;
		if (!n)break;
		int normalans = getans(n, 0);;
		int oddans = getoddans(n, 0);

		cout << normalans << " " << oddans << endl;
	}
	return 0;
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

vector<int> list;
vector<int> kisu;

int dp1[1001000];
int dp2[1001000];

int main() {
	int i;
	for(i=1;;i++){
		int yon=i*(i+1)*(i+2)/6;
		if(yon>1000000)break;
		list.push_back(yon);
		if(yon%2==1)kisu.push_back(yon);
	}
	for(i=0;i<1001000;i++){
		dp1[i]=dp2[i]=i;
	}
	for(i=0;i<1001000;i++){
		int j;
		for(j=0;j<list.size();j++){
			if(i-list[j]<0)break;
			chmin(dp1[i],dp1[i-list[j]]+1);
		}
		for(j=0;j<kisu.size();j++){
			if(i-kisu[j]<0)break;
			chmin(dp2[i],dp2[i-kisu[j]]+1);
		}
	}
	int n;
	while(n=in()){
		cout<<dp1[n]<<" "<<dp2[n]<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
typedef pair<int, int> P;

int d[1000001];

int main()
{
	int tet[1001];
	for (int i = 1; i <= 1000; i++){
		tet[i] = i * (i + 1) * (i + 2) / 6;
	}
	
	int n;
	while (scanf("%d", &n), n){
		fill(d, d + 1000001, INF);
		queue<P> que;
		for (que.push(P(0, 0)); que.size(); que.pop()){
			P p = que.front();
			if (d[p.first] <= p.second) continue;
			d[p.first] = p.second;
			if (p.first == n) break;
			
			for (int i = 1; p.first + tet[i] <= n; i++){
				que.push(P(p.first + tet[i], p.second + 1));
			}
		}
		cout << d[n];
		
		fill(d, d + 1000001, INF);
		while (!que.empty()) que.pop();
		for (que.push(P(0, 0)); que.size(); que.pop()){
			P p = que.front();
			if (d[p.first] <= p.second) continue;
			d[p.first] = p.second;
			if (p.first == n) break;
			
			for (int i = 1; p.first + tet[i] <= n; i++){
				if (tet[i] % 2 == 0) continue;
				que.push(P(p.first + tet[i], p.second + 1));
			}
		}
		cout << " " << d[n] << endl;
	}
	
	return 0;
}

C++: #include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>

using namespace std;

#define INF 999999999
#define REP(i,n) for(int i=0; i<(int)(n); i++)

vector<int> py, od;
int pol[1000000], odd[1000000];

void tri(){
	for(int i=0;i*i*i<=6000000;i++){
		py.push_back(i*(i+1)*(i+2)/6);
		if((i*(i+1)*(i+2)/6)%2==1)od.push_back(i*(i+1)*(i+2)/6);
	}
	//cout << py.size() << " " << od.size() << endl;
}

void tab_pol(){
	pol[0] = 0;
	int ans, ins;
	for(int i=1;i<1000000;i++){
		ans = i;
		for(int j=1;py[j]<=i&&j<py.size();j++){
			ins = 1 + pol[i-py[j]];
			if(ins < ans) ans = ins;
		}
		pol[i] = ans;
	}
}


void tab_odd(){
	odd[0] = 0;
	int ans, ins;
	for(int i=1;i<1000000;i++){
		ans = i;
		for(int j=1;od[j]<=i&&j<od.size();j++){
			ins = 1 + odd[i-od[j]];
			if(ins < ans) ans = ins;
		}
		odd[i] = ans;
	}
}

int main(){
	tri();
	//cout << "tri" <<endl;
	tab_pol();
	//cout << "pol" <<endl;
	tab_odd();
	int n;
	
	while(1){
		cin >> n;
		if(!n) break;
		cout << pol[n] << " " << odd[n] << endl;
	}
	return 0;
}