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


int dp[190][1000010] = { 0 };
int dpodd[190][1000010] = { 0 };
//vector<vector<int>> dp;

int N = 0;
int C[191];
int Codd[51];

void input(void) {
	CI N;

	return;
}


int main(void) {
	int C_N;
	for (int i = 1; i <= 190;i++) {
		C[i - 1] = i * (i + 1) * (i + 2) / 6;
	}
	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 (int j = 1; j <= 189; j++) {
		for (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 (int j = 1; j <= 189; j++) {
		for (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;
}

C++: #include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

#define INF (1<<28)

int t[1000*1000+1];
int ot[1000*1000+1];

void init() {
    memset(t, -1, sizeof(t));
    memset(ot, -1, sizeof(ot));
    for (int i = 1; ; i++) {
        int n = i * (i+1) * (i+2) / 6;
        if (n > 1000*1000) break;
        t[n] = 1;
        if (n % 2) ot[n] = 1;
    }
}

int count_t(int n) {
    if (t[n] >= 0) return t[n];
    int ans = INF;
    for (int i = 1; ; i++) {
        int p = i * (i+1) * (i+2) / 6;
        if (n < p) break;
        ans = min(ans, count_t(n - p)+1);
    }
    return t[n] = ans;
}

int count_odd_t(int n) {
    if (ot[n] >= 0) return ot[n];
    int ans = INF;
    for (int i = 1; ; i++) {
        int p = i * (i+1) * (i+2) / 6;
        if (n < p) break;
        if (p % 2) ans = min(ans, count_odd_t(n - p)+1);
    }
    return ot[n] = ans;
}

int main() {
    init();
    int n;
    while (scanf("%d", &n), n) {
        printf("%d %d\n", count_t(n), count_odd_t(n));
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

constexpr int INF = (1<<30)-1;

int dp1[1000045], dp2[1000045];
bool solve() {
    int N;
    cin >> N;
    if (N == 0) return (false);
    
    cout << dp1[N] << " " << dp2[N] << endl;
    return (true);
}

int main() {
    fill_n(dp1, 1000045, INF);
    fill_n(dp2, 1000045, INF);
    
    dp1[0] = 0;
    dp2[0] = 0;
    for (int i = 0; i <= 1000000; i++) {
        for (int j = 1; i + j * (j + 1) * (j + 2) / 6 <= 1000000; j++) {
            int val = j*(j+1)*(j+2)/6;
            dp1[i + val] = min(dp1[i + val], dp1[i] + 1);
            if (val & 1) dp2[i + val] = min(dp2[i + val], dp2[i] + 1);
        }
    }
    while (solve());
    return (0);
}

C++: #include <iostream>
#include <utility>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)(n); ++i)

int f(int x) {
  return ((x)*(x+1)*(x+2))/6;
}

const int INF = 1 << 28;
int adp[1000000];
int odp[1000000];
bool done[1000000] = {};
bool odan[1000000] = {};
vector<int> list;

int main()
{
  for(int i = 1; f(i) < 1000000; ++i) {
    list.push_back(f(i));
  }
  rep(i, 1000000) {
    adp[i] = INF;
    odp[i] = INF;
  }
  done[0] = true;
  adp[0] = 0;
  odan[0] = true;
  odp[0] = 0;
  for(auto v : list) {
    rep(i, 1000000 - v) {
      if(done[i]) {
        adp[i + v] = min(adp[i + v], adp[i] + 1);
        done[i + v] = true;
      }
      if(v&1 && odan[i]) {
        odp[i + v] = min(odp[i + v], odp[i] + 1);
        odan[i + v] = true;
      }
    }
  }

  int n;
  while(cin >> n, n) {
    cout << adp[n] << " " << odp[n] << endl;
  }

  return 0;
}