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 prime[200],dprime[100];
int dp[2000001],ddp[2000001];
int main(){
	int a=1,b=2,count=1,dcount=1;
	prime[0]=1,dprime[0]=1;
	while(true){
		a+=b;
		b++;
		if(prime[count-1]+a>=1000000)
			break;
		if((prime[count-1]+a)%2==1){
			dprime[dcount]=prime[count-1]+a;
			dcount++;
		}
		prime[count]=prime[count-1]+a;
		count++;
	}
	for(int i=0;i<=2000000;i++)
			dp[i]=i%4+i/4;
	for(int i=0;i<=999999;i++){
		for(int j=0;j<count;j++)
			dp[i+prime[j]]=min(dp[i+prime[j]],dp[i]+1);
	}
	for(int i=0;i<=2000000;i++)
			ddp[i]=i%35+i/35;
	for(int i=0;i<=999999;i++){
		for(int j=0;j<dcount;j++)
			ddp[i+dprime[j]]=min(ddp[i+dprime[j]],ddp[i]+1);
	}
	int n;
	while(true){
		cin>>n;
		if(n==0)
			break;
		cout<<dp[n]<<" "<<ddp[n]<<endl;
	}
	return 0;
}

C++: #define INF 0x7FFFFFFF

int main(void){
	int i, j, k, n, min1;
	int dp[1000001];
	scanf("%d",&n);
	while(n != 0){
		for(i = 0;i <= n;i++)
			dp[i] = INF;
		dp[0] = 0;
		for(k = 0;k < n;k++){
			for(i = n;i >= 0;i--){
				if(dp[i] != INF){
					for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
						if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1)
							dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
					}
				}
			}
			if(dp[n] == 1)
				break;
		}

		min1 = dp[n];
		for(i = 0;i <= n;i++)
			dp[i] = INF;
		dp[0] = 0;
		for(k = 0;k < n;k++){
			for(i = n;i >= 0;i--){
				if(dp[i] != INF){
					for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
						if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1 && j * (j + 1) * (j + 2) / 6 % 2 == 1)
							dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
					}
				}
			}
			if(dp[n] == 1)
				break;
		}
		printf("%d %d\n",min1,dp[n]);
		scanf("%d",&n);
	}
	return 0;
}

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

int main(){
  int simen[200]={};
  for(int i=0;i<200;i++)simen[i] = (i+1) * (i+2) * (i+3) / 6;
  int dp[1000005], kisudp[1000005];
  for(int i=0;i<1000005;i++){dp[i] = inf; kisudp[i] = inf;}
  dp[0]=0;kisudp[0]=0;
  for(int k=0;k<200;k++)for(int i=1;i<1000005;i++){
    if(i >= simen[k])dp[i] = min(dp[i], dp[i-simen[k]] + 1);
  }
  for(int k=0;k<200;k++)for(int i=1;i<1000005;i++){
    if(i >= simen[k] && simen[k]%2 == 1)kisudp[i] = min(kisudp[i], kisudp[i-simen[k]] + 1);
  }

  while(1){
    int N;
    scanf("%d", &N);
    if(N==0)break;
    else printf("%d %d\n", dp[N], kisudp[N]);
  }
  return 0;
}

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

#define int long long
#define pb push_back 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for( int i = 0; i < (n); i++ )
#define Rrep(i, a, n) for( int i = (a); i < (n); i++ )
#define All(v) v.begin(), v.end()

typedef pair<int, int> Pii; 
typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;

int dp[1000001];
int x;

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

int calc(int n, int sum) {
  //cout << n << " " << sum << endl;
  if ( dp[sum] ) return dp[sum];
  if ( sum == x ) return 0;
  if ( sum > x || n > 200 ) return INF;

  int ret = INF;
  if ( sum+four(n) <= x ) {
    ret = min(ret, calc(n, sum+four(n)) + 1);
    ret = min(ret, calc(n+1, sum+four(n)) + 1);
  }
  ret = min(ret, calc(n+1, sum));

  return dp[sum] = ret;
}

int calc_odd(int n, int sum) {
  //cout << n << " " << sum << endl;
  if ( dp[sum] ) return dp[sum];
  if ( sum == x ) return 0;
  if ( sum > x || n > 200 ) return INF;

  int ret = INF;
  if ( sum+four(n) <= x ) {
    ret = min(ret, calc_odd(n, sum+four(n)) + 1);
    ret = min(ret, calc_odd(n+4, sum+four(n)) + 1);
  }
  ret = min(ret, calc_odd(n+4, sum));

  return dp[sum] = ret;
}

signed main() {
  while ( cin >> x, x ) {
    memset(dp, 0, sizeof(dp));
    cout << calc(1, 0) << " ";
    memset(dp, 0, sizeof(dp));
    cout << calc_odd(1, 0) << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n, dp[1000000], dp2[1000000];

void solve() {
  memset(dp, -1, sizeof dp);
  memset(dp2, -1, sizeof dp2);
  
  dp[0] = dp2[0] = 0;
  for (int i = 1; i < 10000; i += 1) {
    dp[i] = dp2[i] = i;
    for (int j = 1;; j += 1) {
      int s = j * (j + 1) * (j + 2) / 6;
      if (s > i) break;
      dp[i] = min(dp[i], dp[i - s] + 1);
      if (s % 2) {
        dp2[i] = min(dp2[i], dp2[i - s] + 1);
      }
    }
  }
  cout<<dp[n]<<" "<<dp2[n]<<endl;
}

int main (int argc, char const* argv[]) {
  
  
  while (cin>>n, n) {
    solve();
  }
  return 0;
}