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 <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <cstdlib>

using namespace std;

#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define REP(i,j,k) for(int i=j;i<(int)(k);++i)
#define foreach(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 99999999;
const double EPS = 1e-9;

const int MAX_N=1000001;
int n;
int dp[MAX_N][2];

int main()
{
        rep(i,MAX_N)rep(j,2) dp[i][j]=INF;
        dp[0][0]=dp[0][1]=0;
        rep(i,MAX_N)for(int j=1;i+(j*(j+1)*(j+2)/6)<MAX_N;++j){
                dp[i+(j*(j+1)*(j+2)/6)][0]=min(dp[i][0]+1,dp[i+(j*(j+1)*(j+2)/6)][0]);
                if((j*(j+1)*(j+2)/6)&1) dp[i+(j*(j+1)*(j+2)/6)][1]
                                                                        = min(dp[i][1]+1,dp[i+(j*(j+1)*(j+2)/6)][1]);
        }

        while(cin >> n,n) cout << dp[n][0] << " " << dp[n][1] << endl;
        return 0;
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };


long int dp[200][1000010] = { 0 };

int N = 0;
int C[200];
int Codd[50];

void input(void) {
	CI N;

	return;
}


int main(void) {
	int C_N;
	for (int i = 1; i <= 200;i++) {
		C[i - 1] = i * (i + 1) * (i + 2) / 6;
	}
	int ii = 1, jj = 0;
	while (true) {
		if (ii * (ii + 1) * (ii + 2) / 6 > 1000000) {
			break;
		}
		if ((ii * (ii + 1) * (ii + 2) / 6) % 2 == 1) {
			Codd[jj] = ii * (ii + 1) * (ii + 2) / 6;
			jj++;
		}
		ii++;
	}

	while (true) {
		input();
		if (N == 0) {
			break;
		}
		for(int i = 1; i <= N; i++) {
			dp[0][i] = 1001000;
		}
		for (int i = 0; i < 200; i++) {
			if (C[i] > N) {
				C_N = i;
				break;
			}
		}
		for (int j = 1; j <= C_N; j++) {
			for (int i = 1; i <= N; i++) {
				if (i < C[j - 1]) {
					dp[j][i] = dp[j - 1][i];
				}
				else {
					dp[j][i] = min(dp[j - 1][i], dp[j][i - C[j - 1]] + 1);
				}
			}
		}

		CO dp[C_N][N] << " ";

		for (int i = 1; i <= N; i++) {
			dp[0][i] = 1001000;
		}
		for (int i = 0; i < 50; i++) {
			if (Codd[i] > N) {
				C_N = i;
				break;
			}
		}
		for (int j = 1; j <= C_N; j++) {
			for (int i = 1; i <= N; i++) {
				if (i < Codd[j - 1]) {
					dp[j][i] = dp[j - 1][i];
				}
				else {
					dp[j][i] = min(dp[j - 1][i], dp[j][i - Codd[j - 1]] + 1);
				}
			}
		}

		CO dp[C_N][N] E
	}
	
	

	
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define print(a) cout<<a<<endl;
int aaa[200] = {}, bbb[200] = {}, counta=1,countb=1, ansa, ansb = 0, xxx[1100000] = {}, yyy[1100000] = {};

int foo(int n, int x){//cout<<n<<" "<<x<<" "<<xxx[x]<<endl;;
	int mi = 1000000;
	if(xxx[n]) return xxx[n]+x;
	if(x > 5) return mi;
	for(int i = counta-1; i >= 1; i--){
		if(aaa[i] < n){
			mi = min(foo(n-aaa[i],x+1), mi);
			if(mi - n == 1)break;
		} else if(aaa[i] < n/2) break;
	}
	
	xxx[n] = mi;
	return mi;
}
int boo(int n, int x){//if(ansb){cout<<n<<" B "<<x<<" "<<yyy[n]<<endl;}
	int mi = 1000000;
	if(yyy[n]) return yyy[n]+x;
	for(int i = countb-1; i >= 1; i--){
		//if(ansb)cout<<bbb[i]<<" "<<n<<endl;
		if(bbb[i] < n){
			mi = min(boo(n-bbb[i],x+1), mi);
			if(mi - n == 1)break;
		} else if(bbb[i] < n/2) break;
	}
	//if(ansb)cout<<"aaaa "<<n<<" "<<x<<" "<<mi<<endl;
	yyy[n] = mi;
	return mi;
}

int main(){
	int i, n, abc;
	for(i = 1; abc <= 1000000; i++){
		abc = (i*(i+1)*(i+2))/6;
		xxx[abc] = 1;
		if(abc%2 == 1){
			yyy[abc] = 1;
			bbb[countb++] = abc;
		}
		aaa[counta++] = abc;
	//	cout<<counta<<" "<<i<<" "<<abc<<endl;;
	}
//	print(1);
	for(i = 1; i <= 1000000; i++){//cout<<i<<endl;
		xxx[i] = foo(i, 0);//cout<<i<<endl;
		yyy[i] = boo(i, 0);//if(i == 966077) cout<<xxx[i]<<" "<<yyy[i]<<endl;
	}	//cout<<"b"<<endl;
	/*for(int i = 1; i <= 1000000; i++){
		//cout<<i<<" "<<yyy[i]<<endl;
	//	if(yyy[i+1]-yyy[i] > 1)cout<<yyy[i+1]<<" "<<yyy[i]<<" "<<i+1<<i<<endl;
	}*/
//	print('a');//ansb = 1;
	while(1){
		cin>>n;
		if(n == 0) break;
		cout<<foo(n,0)<<" "<<boo(n,0)<<endl;
	}
	return 0;
}