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>
#define MAX 1000000
using namespace std;
vector<int> box;
int ans1[MAX+10],ans2[MAX+10];
void tab_make(){
	for(int i=1;i*(i+1)*(i+2)/6<=MAX;i++)
		box.push_back(i*(i+1)*(i+2)/6);
}
void ans_make(){
	ans1[0]=ans2[0]=0;
	for(int i=1;i<=MAX;i++){
		ans1[i]=ans2[i]=i;
		for(int j=0;i-box[j]>=0;j++){
			ans1[i]=min(ans1[i],ans1[i-box[j]]+1);
			if(box[j]%2==1)
			ans2[i]=min(ans2[i],ans2[i-box[j]]+1);
		}
	}
}
int main(){
	int x;
	tab_make();
	ans_make();
	while(cin>>x,x){
		cout<<ans1[x]<<' '<<ans2[x]<<endl;
	}
	return 0;
}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const int N = 1000000;
const int mod = 1000000007;
const int INF = 1 << 30;
#define rep(i,n) for(int i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define fix(n) fixed<<setprecision(n)
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll ss[5000];//正四面体数
vector<ll>v;
ll dp[1000000], dp2[1000000];
int main() {
	v.pb(0);
	ll n, now = 1, now2 = 1;
	rep(i, 5000) {
		ss[i] = (ll)(i*(i + 1)*(i + 2) / 6);
		if (ss[i] % 2 == 1)v.pb(ss[i]);
	}
	rep(i, 1000000) {
		if (i < 2) { dp[i] = i; dp2[i] = i;continue; }
		if (i >= ss[now + 1])++now;
		dp[i] = i / ss[now] + dp[i%ss[now]];
		for (int j = now - 1; j >= 1; --j)dp[i] = min(dp[i], (ll)i / ss[j] + dp[i%ss[j]]);
		if (i >= v[now2 + 1])++now2;
		dp2[i] = i / v[now2] + dp2[i%v[now2]];
		for (int j = now2 - 1; j >= 1; --j)dp2[i] = min(dp2[i], (ll)i / v[j] + dp2[i%v[j]]);
	}
	while (cin >> n, n) {
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <cmath>
#include <time.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define FOR(i, a) for(i = 0; i < (a); i++)
#define FORM(i, a) for(i = (a) i >= 0; i--)
#define INF 100000
using namespace std;
int c[1000], odd[1000];
int mini[1000001];
int miniodd[1000001];
int main(){
int i, j, W, minimumc, minimumodd, l;
 

   for(i = 1; i <= 200; i++){
	   c[i] = (i*(i+1)*(i+2))/6;
   }
   j = 1;
   for(i = 1; i <= 200; i++){
	   if(c[i] % 2 == 1){
		   odd[j] = c[i];
		   j += 1;
	   }
   }

  FOR(i, 1000000){
	  mini[i] = 10000000;
	  miniodd[i] = 10000000;
  }
  mini[0] = 0;
  miniodd[0] = 0;
   for(j = 1; j <= 180; j++){
	 for(i = c[j]; i <= 1000000; i++){
	   mini[i] = min(mini[i], mini[i - c[j]] + 1);
	 }
   }
      for(j = 1; j <= 50; j++){
	 for(i = odd[j]; i <= 1000000; i++){
	   miniodd[i] = min(miniodd[i], miniodd[i - odd[j]] + 1);
	 }
   }
   
	  cin >> W;

	  while(W != 0){
		  cout << mini[W] << " " << miniodd[W] << endl;

		  cin >> W;
	  }

   

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=1;p[i]<=n;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;p[i]<=n;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<185;i++) p[i] = i*(i+1)*(i+2)/6;
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
 
}

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

using namespace std;

int dp1[100010]={0};
int dp2[100010]={0};
int List[100];

void setpolloc(){
	int i,j,li;
	for(i=1;i*(i+1)*(i+2)/6<=100000;i++){
		List[i]=i*(i+1)*(i+2)/6;
		dp1[i*(i+1)*(i+2)/6]=1;
		if((i*(i+1)*(i+2)/6)%2) dp2[i*(i+1)*(i+2)/6]=1;
	}
	List[i]=i*(i+1)*(i+2)/6;
/*	for(i=1;i<=100000;i++){
		if(dp2[i]) continue;
		for(j=1;List[j]<=i-1;j+=2)if(!dp2[i] || dp2[List[j]]+dp2[i-List[j]] < dp2[i]) dp2[i]=dp2[List[j]]+dp2[i-List[j]];
		if(dp1[i]) continue;
		for(j=1;List[j]<=i-1;j++) if(!dp1[i] || dp1[List[j]]+dp1[i-List[j]] < dp1[i]) dp1[i]=dp1[List[j]]+dp1[i-List[j]];
	}
*/}


int main(){
	int n;
	setpolloc();
	while(cin>>n,n){
		cout << dp1[n] << ' ' << dp2[n] << endl;
	}
	return 0;
}