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++: /* C ????§????: ?????? */
#include<bits/stdc++.h>
#define dump(a) cout << (#a) << (a) << endl
using namespace std;

#define MAX_SIZE 2000002

//pollok
int memo_cnt[MAX_SIZE]; //MAX_SIZE??????
vector<int> all_pks;
vector<int> kisu_pks;

//P=pk??????, index=pks????????¨?????´???
int dfs(const int P, const int &now_index, int level, vector<int> &pks)
{
	//dump(level);
	if (P == 0) { return level; }
	if (memo_cnt[P] != -1) { return memo_cnt[P]; } //?????¢????????\
	
	int min_depth = INT_MAX;
	for(int i=now_index; i<pks.size(); i++) { //??§?????????
		int next_P = P-pks[i];
		if (next_P >= 0) {
			int depth = dfs(next_P, i, level+1, pks); //????????°???????????????cnt???
			min_depth = min(min_depth,depth); //????°????????????°
		}
		//?????????????????´???????¬?
	}
	//???????????¢???
	memo_cnt[P] = min_depth;
	
	return min_depth;
}

int main() {
	int n=1;
	while(true) {
		int pk = n * (n+1) * (n+2) / 6;
		if (pk >= MAX_SIZE){ break; }

		all_pks.push_back(pk);
		if (pk % 2 != 0) { kisu_pks.push_back(pk); }
		n++;
	}
	reverse(begin(all_pks),end(all_pks));
	reverse(begin(kisu_pks),end(kisu_pks));

	int P;
	while(cin >> P) {
		if (P == 0) { break; }

		int index=0; //
		int left=0,right=0;
		for(int i=0; i<MAX_SIZE; i++) { memo_cnt[i] = -1; }
		left = dfs(P, 0/*pks???????????????*/, 0/* ??±??? */, all_pks);

		for(int i=0; i<MAX_SIZE; i++) { memo_cnt[i] = -1; }
		right = dfs(P, 0/*pks???????????????*/, 0/* ??±??? */, kisu_pks);
		cout << left << " " << right << endl;
	}


	return EXIT_SUCCESS;
}




	/*
	cout << all_pks.size() << endl;
	for(int i=0; i<all_pks.size(); i++) {
		cout << all_pks[i] << " ";
	}
	cout << endl;

	cout << kisu_pks.size() << endl;
	for(int i=0; i<kisu_pks.size(); i++) {
		cout << kisu_pks[i] << " ";
	}
	cout << endl;
	*/

C++: #include <iostream>
#include <vector>

using namespace std;

int main(int argc, char* argv[]) {
  vector<int> rets;
  vector<int> rets_odd;

  vector<int> options;
  int M = 1000000;
  for (int i = 1;; ++i) {
    int a = i * (i + 1) * (i + 2) / 6;
    if (a > M)
      break;
    options.push_back(a);
  }

  int dp[M + 1];
  for (int i = 0; i < M + 1; ++i)
    dp[i] = 1000000000;
  for (int i = 0; i < options.size(); ++i)
    dp[options[i]] = 1;
  for (int i = 1; i < M; ++i) {
    if (dp[i + 1] == 1)
      continue;
    for (int j = 0; j < options.size(); ++j) {
      if (options[j] > i)
        continue;
      if (dp[i - options[j] + 1] != 1000000000) {
        dp[i + 1] = min(dp[i + 1], dp[i - options[j] + 1] + 1);
      }
    }
  }

  vector<int> options_odd;
  for (int i = 1;; ++i) {
    int a = i * (i + 1) * (i + 2) / 6;
    if (a > M)
      break;
    if (a % 2 == 1)
      options_odd.push_back(a);
  }

  int dp_odd[M + 1];
  for (int i = 0; i < M + 1; ++i)
    dp_odd[i] = 1000000000;
  for (int i = 0; i < options_odd.size(); ++i)
    dp_odd[options_odd[i]] = 1;
  for (int i = 1; i < M; ++i) {
    if (dp_odd[i + 1] == 1)
      continue;
    for (int j = 0; j < options_odd.size(); ++j) {
      if (options_odd[j] > i)
        continue;
      if (dp_odd[i - options_odd[j] + 1] != 1000000000) {
        dp_odd[i + 1] = min(dp_odd[i + 1], dp_odd[i - options_odd[j] + 1] + 1);
      }
    }
  }

  while (true) {
    int n;
    cin >> n;

    if (n == 0)
      break;

    rets.push_back(dp[n]);
    rets_odd.push_back(dp_odd[n]);

  }

  for (int i = 0; i < rets.size(); ++i)
    cout << rets[i] << " " << rets_odd[i] << endl;


  return 0;
}

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;
	}

	cout << num << "\t" << triangle[num] << endl;

	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){
		cin >> n;
		if (n == 0)break;

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

	return 0;
}