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 <bits/stdc++.h>
using namespace std;
const int dx[]={0,1,0,-1,1,-1,-1,1};
const int dy[]={-1,0,1,0,1,1,-1,-1};
const int INF = 1<<30;
const int EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fi first
#define se second
#define ll long long
#define reps(i,j,k) for(int i = (j); i < (k); i++)
#define rep(i,j) reps(i,0,j)
#define MOD 1000000007
typedef pair<int,int> Pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int dp[2][1000010];
int data[1000010];
int main(){
	int index=1;
	while(index*(index+1)*(index+2)/6 < 10000000){
		data[index-1] = index*(index+1)*(index+2)/6;
		index++;
	}
	fill(dp[0],dp[0]+1000000,INF);
	fill(dp[1],dp[1]+1000000,INF);
	dp[0][0] = dp[1][0] = 0;
	rep(i,1000000){
		rep(j,index){
			if(i+data[j] < 1000000){
				dp[0][i+data[j]] = min(dp[0][i+data[j]],dp[0][i]+1);
				if(data[j] % 2 == 1){
					dp[1][i+data[j]] = min(dp[1][i+data[j]],dp[1][i]+1);
				}
			}
		}
	}

	int N;

	while(scanf("%d",&N),N){
		printf("%d %d\n",dp[0][N],dp[1][N]);
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
#include <fstream>
#include <cstdint>
#include <cmath>
#include <algorithm>
#include <utility>
#include <numeric>
#include <functional>
#include <unordered_map>

using namespace std;

typedef int64_t ll;
vector<int> polc;
array<int, 1000000> p, od;

void calc(){
    for (int i = 0; i < p.size(); ++i) {
        p[i] = od[i] = i;
    }

    for(auto&& plc: polc){
        for (int i = plc; i < p.size(); ++i) {
            p[i] = min(p[i], p[i-plc] + 1);
        }
        if(plc % 2) {
            for (int i = plc; i < p.size(); ++i) {
                od[i] = min(od[i], od[i - plc] + 1);
            }
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    for (int i = 1; i < 1000; ++i) {
        int pl = i*(i+1)*(i+2) / 6;
        if(pl > 1000000) break;
        polc.push_back(pl);
    }
    int n;
    calc();
    while(cin >> n){
        if(n == 0)
            break;
        cout << p[n] << ' ' << od[n] << endl;
    }


}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#define N 1000000
#define INFINITY 2000000000
using namespace std;
int dp[200][N],data[N];
vector<int> data2;
int DP(int);
int DP2(int);
int main(){
  int i,out,out2,n,c;
  data2.push_back(0);
  for(i=1;i<N;i++){
    data[i]=i*(i+1)*(i+2)/6;
    if(data[i]>N){
      c=i;
    }
    if(data[i]%2==1){
      data2.push_back(data[i]);
    }
  }
  while(1){
    cin >> n;
    if(n==0) break;
    out=DP(n);
    out2=DP2(n);
    cout << out << ' ' << out2 << endl;
  }
  return 0;
}
int DP(int n){
  int i,j,minret,s;
  for(i=1;i<N;i++){
    if(data[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}
int DP2(int n){
  int i,j,minret,s,len;
  len=data2.size();
  for(i=1;i<len;i++){
    if(data2[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data2[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data2[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#define X first
#define Y second
using namespace std;
int fourth[201];
int odd[201];
int mintable[1500000];
int mintableOdd[1500000];

void Init(){
	fourth[0] = 0;
	odd[0] = 0;
	for(int i = 1, j = 1; i <= 200; i++){
		fourth[i] = (i*(i+1)*(i+2))/6;
		mintable[fourth[i]] = 1;
		if(fourth[i]%2){
			odd[j] = fourth[i];
			mintableOdd[odd[j]] = 1;
			j++;
		}
	}
}

int dfs(int n){
	for(int i = 2; i <= n/i; i++){
		if(n%i==0){
			return min(dfs(n/i)*i, mintable[n]);
		}
	}
	return mintable[n];
}

int dfsOdd(int n){
	for(int i = 3; i <= n/i; i+=2){
		if(n%i==0){
			return min(dfsOdd(n/i)*i, mintableOdd[n]);
		}
	}
	return mintableOdd[n];
}

int countFourth(int n){
	int min = 10000;
	for(int i = 200; i >= 1; i--){
		if(n>=fourth[i]){
			int tmp = n;
			int count = 0;
			for(int j = i; j >= 1; j--){
				while(tmp>=fourth[j]){
					count++;
					tmp -= fourth[j];
				}
			}
			min = min>count?count:min; 
		}
	}
	return min;
}

int countFourthOdd(int n){
	int min = 10000;
	for(int i = 50; i >= 1; i--){
		if(n>=odd[i]){
			int tmp = n;
			int count = 0;
			for(int j = i; j >= 1; j--){
				while(tmp>=odd[j]){
					count++;
					tmp -= odd[j];
				}
			}
			min = min>count?count:min; 
		}
	}
	return min;
}

int main(){
	memset(mintable, 0, sizeof(mintable));
	Init();
	int n = 0;
	while(cin >> n && n != 0){
		for(int i = 1; i <= n; i++){
			if(mintable[i]&&mintableOdd[i]) continue;		
			mintable[i] = countFourth(i);
			mintable[i] = dfs(i);
			mintableOdd[i] = countFourthOdd(i);
			mintableOdd[i] = dfsOdd(i);
		}
		cout << mintable[n] << " " << mintableOdd[n] << endl;
	}
	return 0;
}