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

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30

using namespace std;
typedef long long ll;

vector<int> v,v2;
int d[1000005];
int d2[1000005];

int main()
{
    rep(i,200) {
        int t = i * (i+1) * (i+2);
        t /= 6;

        if(t%2 == 0) {
            v.push_back(t);
        }
        else {
            v.push_back(t);
            v2.push_back(t);
        }
    }

    fill(d,d+1000005,INF);
    fill(d2,d2+1000005,INF);

    d[0] = 0;
    d2[0] = 0;

    rep(i,1000005) {
        rep(j,v.size()) {
            int next = i + v[j];
            if(next < 1000005) {
                d[next] = min(d[next],d[i]+1);
            }
        }

        rep(j,v2.size()) {
            int next = i + v2[j];
            if(next < 1000005) {
                d2[next] = min(d2[next],d2[i]+1);
            }

        }
    }

    int n;
    while(cin >> n && n) {
        cout << d[n] << " " << d2[n] << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;

const int N = 1000000 + 1;
ll dp[N], dp2[N];

int main() {

    dp[0] = dp2[0] = 0;
    for (int i=1; i<=N; ++i) {
        dp[i] = dp2[i] = i;
        for (int n=1;; ++n) {
            int p = n*(n+1)*(n+2)/6;
            if (p > i) break;
            dp[i] = min(dp[i], dp[i-p]+1);
            if (p%2) {
                dp2[i] = min(dp2[i], dp2[i-p]+1);
            }
        }
    }

    int n;
    while (cin >> n and n) {
        cout << dp[n] << " " << dp2[n] << endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}

const int INF = 1001001001;
int main() {
    int dp[1000001],odddp[1000001];
    rep(i,1000001) {
        dp[i] = INF;
        odddp[i] = INF;
    }      
    dp[0] = 0;
    odddp[0] = 0;
    for(int i = 1;;i++) {
        int num = i*(i+1)*(i+2)/6;
        if(num>1000000) break;
        for(int j = num;j<=1000000;j++) {
            dp[j] = min(dp[j],dp[j-num] + 1);
            if(num%2==1) {
                odddp[j] = min(odddp[j],odddp[j-num] + 1);
            }
        }
    }
    while(true) {
        int n;
        cin >> n;
        if(n==0) break;
        cout << dp[n] << " " << odddp[n] << endl;
    }

}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1111111];
int memo2[1111111];
 
int solve(int n){
   
  if(!n) return 0;
  if(~memo[n]) return memo[n];
 
  int ans = INF;
  for(int i=1;n<=p[i] && i<181;i++) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(~memo2[n]) return memo2[n];
 
  int ans = INF;
  for(int i=1;n<=p[i] && i<181;i++) if(p[i]&1) ans = min(ans, solve2(n-p[i])+1);
 
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  memset(memo, -1, sizeof(memo));
  memset(memo2, -1, sizeof(memo2));
 
  for(int i=0;i<181;i++) p[i] = i*(i+1)*(i+2)/6;
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
 
}

C++: #include <iostream>

using namespace std;

const int NMAX=1000001;

int main()
{
	static int p[200];
	for(int i=0;i<200;i++)
		p[i]=(i+1)*(i+2)*(i+3)/6;
	
	static int a[NMAX],b[NMAX];
	for(int i=0;i<NMAX;i++)
		a[i]=b[i]=i;
	for(int i=0;i<200;i++){
		for(int j=p[i];j<NMAX;j++)
			a[j]=min(a[j],a[j-p[i]]+1);
		if(!(p[i]&1)) continue;
		for(int j=p[i];j<NMAX;j++)
			b[j]=min(b[j],b[j-p[i]]+1);
	}
	
	for(int n;cin>>n,n;)
		cout<<a[n]<<" "<<b[n]<<endl;
	
	return 0;
}

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

int main(){
	int num[100010];
	for(int i=0; i< 100010; i++) num[i] = 10e8;
	num[0] = 0;
	for(int j=0; j< 100010; j++){
		for(int i=1; i < 1000; i++){
			int m = i*(i+1)*(i+2)/6;
			if(10010 <= i*(i+1)*(i+2)/6+j) continue;
			num[j+m] = min(num[j]+1, num[j+m]);
		}
	}
	int num2[100010];
	for(int i=0; i< 100010; i++) num2[i] = 10e8;
	num2[0] = 0;
	for(int j=0; j< 100010; j++){
		for(int i=1; i < 1010; i++){
			int m = i*(i+1)*(i+2)/6;
			if(m%2 == 0) continue;
			if(10010 <= i*(i+1)*(i+2)/6+j) continue;
			num2[j+m] = min(num2[j]+1, num2[j+m]);
		}
	}
	int n;
	while(cin >> n, n){
		cout << num[n] << " " << num2[n] << endl;
	}
}