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 <iostream>
using namespace std;

int dp[1000001], dp2[1000001];

int nums[200] = {0};

int main(){

    for(int i = 0;i < 200;i++) nums[i] = i * (i + 1) * (i + 2) / 6;

    int n;
    while(1){
        cin >> n;
        if(n == 0) break;

        for(int i = 0;i <= n;i++) dp[i] = dp2[i] = 100002;
        dp[0] = dp2[0] = 0;

        for(int j = 1;nums[j] <= n;j++) {
            for(int i = nums[j];i <= n;i++) {
                if(dp[i] > dp[i - nums[j]] + 1) {
                    dp[i] = dp[i - nums[j]] + 1;
                }
                if(dp2[i] > dp2[i - nums[j]] + 1) {
                    if(nums[j] % 2 == 1) dp2[i] = dp2[i - nums[j]] + 1;
                }
            }
        }
        cout << dp[n] << ' ' << dp2[n] << endl;
    }
}

C++: #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600
#define MAX 1000000

vector<int> nums,odds;

int  dp[MAX+1];
int dp2[MAX+1];

int dfs(int n, int *memo, vector<int> &vec){
  if(memo[n]!=-1) return memo[n];
  int ret = INF;
  for(int nxt : vec){
    if(n==nxt) return 1;
    if(n>nxt) ret = min(ret, dfs(n-nxt, memo, vec)+1);
  }
  return memo[n] = ret;
}

int main(){
  int tmp=0, n=1;
  while(tmp<=MAX){
    tmp+=n*(n+1)/2;
    nums.pb(tmp);
    if(tmp%2==1) odds.pb(tmp);
    n++;
  }

  fill(dp, dp+MAX+1, -1);
  fill(dp2, dp2+MAX+1, -1);

  dp[0] = dp2[0] = 0;

  // ??§????????????????????????????????¨?????°?????°????¢????????????????
  reverse(all(nums));
  reverse(all(odds));

  while(cin>>n, n){
    cout << dfs(n, dp, nums) << " " << dfs(n, dp2, odds) << endl;
  }

  return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;

typedef long long ll;

#define arrsize 500000

ll memo[arrsize];
ll memo2[arrsize];

ll calc(int n) {
  return n * (n + 1) * (n + 2) / 6;
}

int dfs(int depth, int n) {
  int ans = 9999;
  if (n < arrsize && memo[n] != 0) return memo[n];
  for (int i = sqrt(n); i >= 1; i--) {
    
    ll t = calc(i);
    if (n - t < 0) continue;
    if (n - t == 0) {
      if (n < arrsize) {
	memo[n] = depth;
      }
      return depth;
    }
    ans = min(ans, dfs(depth + 1, n - t));
  }
  if (n < arrsize)
    memo[n] = ans;
  return ans;
}

int dfs_odd(int depth, int n) {
  int ans = 9999;
  if (n < arrsize && memo2[n] != 0) return memo2[n];
  for (int i = sqrt(n); i >= 1; i--) {
    ll t = calc(i);
    if (t % 2 == 0) continue;
    if (n - t < 0) continue;
    if (n - t == 0) {
      if (n < arrsize)
	memo2[n] = depth;
      return depth;
    }
    ans = min(ans, dfs_odd(depth + 1, n - t));
  }
  if (n < arrsize)
    memo2[n] = ans;
  return ans;
}
  
int main() {
  int N;
  while (cin >> N, N != 0) {
    for (int i = 0; i < arrsize; i++) {
      memo[i] = 0;
      memo2[i] = 0;
   }
    cout << dfs(1, N) << " " << dfs_odd(1, N) << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>

int ans1[1048576];
int ans2[1048576];
std::vector<int> num4;
std::vector<int> numodd4;

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

  // step 1
  for(int i = 1; ; ++i) {
    int t = i * (i + 1) * (i + 2) / 6;
    if( t >= 1048576 ) break;
    num4.push_back(t);
    if( t % 2 == 1 ) numodd4.push_back(t);
  }
  std::sort(std::begin(num4), std::end(num4));
  std::sort(std::begin(numodd4), std::end(numodd4));
  num4.erase(std::unique(std::begin(num4), std::end(num4)), std::end(num4));
  numodd4.erase(std::unique(std::begin(numodd4), std::end(numodd4)), std::end(numodd4));

  // step 2
  for(int i = 1; i < 1048576; ++i) {
    int min = 1048576;
    for(int dx : num4) {
      int previ = i - dx;
      if( previ < 0 ) break;
      min = std::min(min, ans1[previ] + 1);
    }
    ans1[i] = min;
  }

  // step 3
  ans2[0] = 0;
  for(int i = 1; i < 1048576; ++i) {
    int min = 1048576;
    for(int dx : numodd4) {
      int previ = i - dx;
      if( previ < 0 ) break;
      min = std::min(min, ans2[previ] + 1);
    }
    ans2[i] = min;
  }
  
  // step 4
  for(;;) {
    int N;
    scanf("%d", &N);
    if( N == 0 ) break;
    printf("%d %d\n", ans1[N], ans2[N]);
  }
  
  return 0;
}