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 <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-9;
const double PI  = acos(-1.0);

ll dp[1000001],dpo[1000001];

const ll MAX=LONG_MAX/10;

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

ll dfs(ll n,bool odd,int size){
	ll (&dpp)[1000001]=(odd?dpo:dp);
	if(dpp[n]!=MAX){
		return dpp[n];
	}
	if(n==0){
		return 0;
	}
	if(size>100){
		return MAX;
	}
	ll ret=MAX;
	for(ll j=1,i=pol(j);i<=n;j++,i=pol(j)){
		if(odd&&(!(i&1)))continue;
		ret=min(ret,dfs(n-i,odd,size+1)+1);
	}
	return dpp[n]=ret;
}

int main(){
	ll n;
	REP(i,1000001){
		dp[i]=MAX;
	}
	REP(i,1000001){
		dpo[i]=MAX;
	}
	while(cin>>n,n){
		cout<<dfs(n,false,0);
		cout<<" "<<dfs(n,true,0)<<endl;
	}
	
}

C++: #include<iostream>
#include<vector>
using namespace std;
int x,y;
int m[1000005]={};
int memo[1000005]={};
vector<int> odd;
void saiki(int n,int d){
  int i,j;
  //cout << n << ":" << d << ":" << x << endl;
  if(n==0) {
    //cout << x << d << endl;
    x=min(x,d);
  }else if(n>0) {
    if(memo[n]>0){
      x=min(x,memo[n]+d);
    }else{
      for(i=1;m[i]<=n;i++);
      i--;
      for(j=i;j>0;j--){
	if(x>d+1)
	  saiki(n-m[j],d+1);
      }
      if(x>d+2)
	memo[n]=x-d;
      //cout << n << ":" << memo[n]<< endl;
    }
  }
}
void saiki2(int n,int d){
  int i,j;
  //cout << n << ":" << d << endl;
  if(n==0) {
    y=min(y,d);
  }else if(n>0) {
    for(i=0;odd[i]<=n;i++);
    i--;
    //cout << i << ":" << n << ":" << odd[i] << endl;
    for(j=i;j>=0;j--){
      if(y>d+1){
	saiki2(n-odd[j],d+1);
      }
    }
  }
}
int main(){
  int i,j,k;
  fill(memo,memo+1000005,-1);
  for(i=1;i<1000005;i++) {
    m[i]=i*(i+1)*(i+2)/6;
    if(m[i]%2==1) odd.push_back(m[i]);
  }
  int n;
  cin >> n;
  while(n!=0){
    x=1<<10;y=x;
    saiki(n,0);saiki2(n,0);
    cout << x << " " <<  y << endl;
    cin >> n;
  }
  return 0;
}

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

 int i,j,n,three[1000000],four[1000000],four_2[1000000],c[1000000],c_2[1000000];

int main(){
  
  three[0] = 1;
  four[0] = 1;
  for( i = 1; i < 1000000; i++ )three[i] = i+1 + three[i-1];
  for( i = 1; i < 1000000; i++ )four[i] = three[i] + four[i-1];
  
  int k = 0;
  for( i = 0; i < 1000000; i++ ){
    if(four[i] %2 == 1 ){
      four_2[k] = four[i];
      k++;
    }
  }
  
  while(1){
    int n; cin >> n;
    if(n==0)break;
    for( i = 0; i <= n; i++ ){
      c[i] = 2000000;
      c_2[i] = 2000000;
    }

    c[0] = 0;
    for( i = 0; i < 50; i++ ){
      for( j = four[i]; j <= n; j++ ){
	c[j] = min( c[j],c[j-four[i]] + 1 );
      }
    }

    c_2[0] = 0;
    for( i = 0; i < 50; i++ ){
      for ( j = four_2[i]; j <= n; j++ ){
	c_2[j] = min( c_2[j],c_2[j-four_2[i]] + 1 );
      }
    }
    cout << c[n] << " " << c_2[n] << endl;
  }
    return 0;
}

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=180;i>0;i--) if(n >= p[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=180;i>0;i--) if(p[i]&1 && n >= p[i]) 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;

  //for(int i=0;i<1111111;i+=10){ solve(i), solve2(i); }
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
 
}