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<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
//#define mt make_tuple
//typedef tuple<int,string> tp;
//typedef vector<tp> vt;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e9;
const ll INF=2e18;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
	vi dp(1000010,inf);
	vi dp2(1000010,inf);
	dp[0]=dp2[0]=0;
	loop(i,1,2000){
		int a=i*(i+1)*(i+2)/6;
		if(a>=1000010)break;
		rep(j,1000010)if(j+a<1000010)dp[j+a]=min(dp[j+a],dp[j]+1);else break;
		if(a%2)rep(j,1000010)if(j+a<1000010)dp2[j+a]=min(dp2[j+a],dp2[j]+1);else break;
	}
	int n;
	while(cin>>n,n)cout<<dp[n]<<" "<<dp2[n]<<endl;
}

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

using namespace std;

#define MAX 1000000

int N, pol[MAX], odd[MAX];

int main() {
	for (int i = 0; i < MAX; i++) {
		pol[i] = MAX;
		odd[i] = MAX;
	}

	pol[0] = odd[0] = 0;

	for (int i = 0; i < MAX; i++)
		for (int j = 1; j < MAX; j++) {
			int k = j * (j + 1) * (j + 2) / 6;
			if (i + k >= MAX)
				break;
			pol[i + k] = min(pol[i + k], pol[i] + 1);
			if ((k & 1) == 1)
				odd[i + k] = min(odd[i + k], odd[i] + 1);
		}

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

C++: #include <iostream>
using namespace std;
int main(){
  int a[190]={0},b[50]={0},c[1000001]={0,1,2,3},d[1000001],k=0,i,j,n;
  for(i=1;i<190;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<189;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<int> smt(1,0);
  vector<int> ksmt(1,0);
  int a;
  for(int i=1;i<10000;i++){
    a=i*(i+1)*(i+2)/6;
    smt.push_back(a);
    if(a%2==1)ksmt.push_back(a);
    if(a>1000000)break;
    //cout << a << endl;
  }
  while(1){
    //cout <<smt.size()<<" "<<ksmt.size()<<endl;
    int dp[2][1000001]={};
    //cout <<"2"<<endl;
    int n;
    cin >> n;
    int m=0,k=1;
    if(n==0)break;
    //
    for(int i=1;i<=n;i++){
      dp[0][i]=i;
    }
    //all
    for(int i=1;i<smt.size();i++){
      if(smt[i]>n){
	cout << dp[m][n]<<" ";
	break;
      }
      for(int j=1;j<=n;j++){
	if(smt[i]>j) dp[k][j]=dp[m][j];
	else{
	  dp[k][j]=min(dp[m][j],dp[k][j-smt[i]]+1);
	}
	//cout <<dp[k][j]<<" ";
      }
      swap(m,k);
    }
    //reset
    for(int i=1;i<=n;i++){
      dp[0][i]=i;
    }
    m=0,k=1;
    //kisuu
    for(int i=1;i<ksmt.size();i++){
      if(ksmt[i]>n){
	cout << dp[m][n]<<endl;
	break;
      }
      for(int j=1;j<=n;j++){
	if(ksmt[i]>j) dp[k][j]=dp[m][j];
	else{
	  dp[k][j]=min(dp[m][j],dp[k][j-ksmt[i]]+1);
	}
      }
      swap(m,k);
    }
  }
  return 0;
}

C++: #define _USE_MATH_DEFINES
#define INF 100000000

#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>

using namespace std;

typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P> PP;

static const double EPS = 1e-8;

int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};

int dp[1000000];
int dp_odd[1000000];

int main(){

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

	dp[0] = 0;
	dp[1] = 1;
	dp_odd[0] = 0;
	dp_odd[1] = 1;

	for(int i=0;i<=1000000;i++){
		for(int j=1;j<=1000000;j++){
			int b = (j)*(j+1)*(j+2)/6;
			if(i+b >= 1000000) break;
			dp[i+b] = min(dp[i+b],dp[i] + 1);
			if(b % 2){
				dp_odd[i+b] = min(dp_odd[i+b],dp_odd[i] + 1);
			}
		}
	}


	int n;
	while(~scanf("%d",&n)){
		if(n==0) break;
		printf("%d %d\n",dp[n],dp_odd[n]);
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>

using namespace std;

int dx[]={0,1,0,-1};
int dy[]={-1,0,1,0};
typedef pair<int,int> p;

int main()
{
	
	vector<int> all(1000001),odd(1000001);
	for(int i=0;i<=1000000;i++){
		all[i]=odd[i]=i; //??¨???1???????????´???
	}
	
	
	for(int i=1;;i++){
		int x=i*(i+1)*(i+2)/6;
		if(x>1000000) break;
		
		for(int j=0;j<=1000000;j++){
			if(j-x<0) continue;
			
			all[j]=min(all[j],all[j-x]+1);
			if(x%2) odd[j]=min(odd[j],odd[j-x]+1);
		}
	}
			
	int n;
	while(cin>>n,n){
		
		cout<<all[n]<<" "<<odd[n]<<endl;
		
	}
	
	
	return 0;
}