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 1000000

//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<algorithm>
#include<vector>

using namespace std;

int tetrahedron(int);

int index_direct_match(int);
int index_direct_match_odd(int);
int index_number(int);
int index_number_odd(int);

int main(int argc, char const *argv[]) {

  int n;
  int cnt_min;
  int cnt_only_odd;

  for(cin >> n;n != 0;cin >> n){

    cout << index_number(n) << " " <<  index_number_odd(n) << endl;

  }

  //

  return 0;
}

int tetrahedron(int k){

  return k*(k+1)*(k+2)/6;

}

int index_number(int index){
  static int memo[1000]={};
  if(index>=1 && index<=3) return index;
  else if(index_direct_match(index)) return 1;
  else if(memo[index] != 0) return memo[index];
  else{
    vector<int> comp_array;
    for(int i=1;index > tetrahedron(i);i++){
      //cout << "index:" << index << endl;
      //cout << "tetra:" << tetrahedron(i) << endl;
      comp_array.push_back(1+index_number( index - tetrahedron(i) ));
    }
    memo[index]=(int)*min_element(comp_array.begin(),comp_array.end());
    return *min_element(comp_array.begin(),comp_array.end());
  }

}

int index_direct_match(int index){

  for(int i=1;i<200;i++){
    if(index == tetrahedron(i)){
      return 1;
    }
  }
  return 0;
}

int index_direct_match_odd(int index){

  for(int i=1;i<200;i+=4){
    if(index == tetrahedron(i)){
      return 1;
    }
  }
  return 0;
}

int index_number_odd(int index){
  static int memo2[1000]={};
  if(index>=1 && index<=34) return index;
  else if(index_direct_match_odd(index)) return 1;
  else if(memo2[index] != 0) return memo2[index];
  else{
    vector<int> comp_array;
    for(int i=1;index > tetrahedron(i);i+=4){
      //cout << "index:" << index << endl;
      //cout << "tetra:" << tetrahedron(i) << endl;
      comp_array.push_back(1+index_number_odd( index - tetrahedron(i) ));
    }
    memo2[index]=(int)*min_element(comp_array.begin(),comp_array.end());
    return *min_element(comp_array.begin(),comp_array.end());
  }
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int dp[2][1000001];
int v[1000];
int main()
{
	int n;
	for (int j = 0; j <= 1000000; j++)
	{
		dp[0][j] = 999999;
		dp[1][j] = 999999;
	}
	dp[0][0] = 0;
	dp[1][0] = 0;
	for (int i = 1;; i++)
	{
		int k = i * (i + 1) * (i + 2) / 6;
		if (k > 1000000)break;
		v[i - 1] = k;
	}
	for (int i = 0; i <= 1000000; i++)
	{
		for (int j = 0;; j++)
		{
			if (i + v[j] > 1000000)break;
			dp[0][i + v[j]] = min(dp[0][i + v[j]], dp[0][i] + 1);
			if (v[j] % 2 == 0)continue;
			dp[1][i + v[j]] = min(dp[1][i + v[j]], dp[1][i] + 1);
		}
	}
	while (cin >> n && n != 0)
	{
		cout << dp[0][n] << " " << dp[1][n] << endl;
	}
	return 0;
}

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

const int MAX = int(1e6);

int dp[MAX];
int odp[MAX];

int main(void)
{
    int n;

    fill(dp, dp + MAX, MAX);
    fill(odp, odp + MAX, MAX);
    dp[0] = odp[0] = 0;
    for (int i = 0; i < 200; i++){
        int tetra = i * (i + 1) * (i + 2) / 6;
        for (int j = 0; j < MAX - tetra; j++){
            dp[j + tetra] = min(dp[j + tetra], dp[j] + 1);
        }
        if (tetra % 2 == 1){
            for (int j = 0; j < MAX - tetra; j++){
                odp[j + tetra] = min(odp[j + tetra], odp[j] + 1);
            }
        }
    }
    while (cin >> n, n){
        printf("%d %d\n", dp[n], odp[n]);
    }

    return 0;
}