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 <cmath>
#include <cstring>

using namespace std;

int MAX;
vector<int> V;
vector<int> D;
int N;
int M;
bool dp[10][100010] = {0};

void solve(int n) {
	int ans = 1;

	for (int i=0; V[i]<=n; i++)
		dp[0][V[i]] = 1;

	for (int i=1; i<5 && !dp[i-1][n]; i++) {
		ans++;
		for (int j=0; j<n; j++) {
			if (!dp[i-1][j]) continue;
			for (int k=0; j+V[k]<=n; k++)
				dp[i][j+V[k]] = 1;
			if (dp[i][n]) break;
		}
	}

	cout << ans << " ";

	memset(dp, 0, sizeof(dp));

	ans = 1;

	for (int i=0; D[i]<=n; i++)
		dp[0][D[i]] = 1;

	for (int i=1; i<=100000 && !dp[1-i%2][n]; i++) {
		ans++;
		for (int j=0; j<n; j++) {
			if (!dp[1-i%2][j]) continue;
			for (int k=0; j+D[k]<=n; k++)
				dp[i%2][j+D[k]] = 1;
			if (dp[i%2][n]) break;
		}
	}

	cout << ans << endl;
}

int main() {
	MAX = (int)pow(10.0, 6);
	for (int i=1; i*(i+1)*(i+2)/6<=MAX; i++) {
		V.push_back(i*(i+1)*(i+2)/6);
		if ( V[i-1]%2==1 ) D.push_back(i*(i+1)*(i+2)/6);
	}
	N = (int)V.size();
	M = (int)D.size();

	int n;
	cin >> n;
	while (n!=0) { 
		solve(n);
		cin >> n;
	}
	return 0;
}

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

using namespace std;

int main(void)
{
	int n;
	int i1,i2;
	int nn;
	int p;
	int min;
	int num;

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

		vector<int> pollock(n+1,0);
		vector<int> pollock2(n+1,0);
		vector<int> p;
		vector<int> p2;
		nn=1;
		num=(nn*(nn+1)*(nn+2))/6);

		for(i1=1;i1<=n;i1++){			

			if(i1==num) {
				if(i1%2==1){
					p.push_back(i1);
					p2.push_back(i1);
					nn++;
					num=(nn*(nn+1)*(nn+2))/6);
					pollock[i1]=1;
					pollock2[i1]=1;
				}
				else {
					nn++;
					num=(nn*(nn+1)*(nn+2))/6);
					p.push_back(i1);
					pollock[i1]=1;
					min=100000;
					for(i2=0;i2<p2.size();i2++){
						if((pollock2[i1-p2[i2]])<min){
							min=pollock2[i1-p2[i2]];
						}
					}
					pollock2[i1]=min+1;
				}
			}
			else {
				min=100000;
				for(i2=0;i2<p.size();i2++){
					if((pollock[i1-p[i2]])<min){
						min=pollock[i1-p[i2]];
					}
				}
				pollock[i1]=min+1;

				min=100000;
				for(i2=0;i2<p2.size();i2++){
					if((pollock2[i1-p2[i2]])<min){
						min=pollock2[i1-p2[i2]];
					}
				}
				pollock2[i1]=min+1;
			}
			//cout<<pollock[i1]<<" ";

		}

		cout << pollock[n] << " " << pollock2[n] << endl;
		

	}

	return 0;
}

C++: #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const double PI = acos(-1);
const ll MOD = 1000000007;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
 
template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}
///////////////////////////////////////////////////////////////

ll dfs(string S) {
  int N = S.size();
  if (S[1] != '[') {
    ll k = stoll(S.substr(1,N-2));
    return k / 2 + 1;
  }
  int count = 0;
  vector<ll> A;
  string t = "";
  for (int i = 1; i < N-1; i++) {
    if (S[i] == '[') count++;
    if (S[i] == ']') count--;
    t.push_back(S[i]);
    if (count == 0) {
      A.emplace_back(dfs(t));
      t = "";
    }
  }
  sort(all(A));
  ll y = 0;
  rep(i,A.size() / 2 + 1) y += A[i];
  return y;
}

int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr); //入出力高速化
  vector<int> sum = {1};
  int k = 0;
  while (sum[k] <= 1000000) {
    sum.emplace_back(sum[k] + (k+2));
    k++;
  }

  vector<int> four{1};
  k = 0;
  while (four[k] <= 1000000) {
    four.emplace_back(four[k] + sum[k+1]);
    k++;
  }

  int N = four.size();
  vector<int> dp(1000001,INF);
  dp[0] = 0;
  for (int i = 1; i <= 1000000; i++) {
    rep (j,N) {
      if (i < four[j]) continue;
      chmin(dp[i],dp[i-four[j]] + 1); 
    }
  }

  vector<int> odd(1000001,INF);
  odd[0] = 0;
  for (int i = 1; i <= 1000000; i++) {
    rep(j,N) {
      if (four[j] % 2 == 0) continue;
      if (i < four[j]) continue;
      chmin(odd[i],odd[i - four[j]] + 1);
    }
  }

  while (true) {
    int n; cin >> n;
    if (n == 0) break;
    cout << dp[n] << " " << odd[n] << endl;
  }
}