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 <iomanip>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>

using namespace std;

constexpr int MAX_VAL = 1e6;
int min_n = MAX_VAL;

void makePyramidal(vector<int>* pyramidal, vector<int>* odd_pyramidal, const int& max_val) {
    for (int i = 1; ; i++) {
        int val = i * (i+1) * (i+2) / 6;
        if (val > max_val) { break; }
        pyramidal->push_back(val);
        if (val % 2) { odd_pyramidal->push_back(val); }
    }
    reverse(pyramidal->begin(), pyramidal->end());
    reverse(odd_pyramidal->begin(), odd_pyramidal->end());
}

void searchPyramidal(const vector<int>& pyramidal, const int& val, const int& i, const int& n) {
    //cout << val << " "<< i << " " << n << endl;
    if (val < 0 or i >= pyramidal.size() or n >= min_n) { return; }
    if (val == 0) {
        min_n = n;
        return;
    }
    searchPyramidal(pyramidal, val - pyramidal[i], i, n + 1);
    searchPyramidal(pyramidal, val - pyramidal[i], i + 1, n + 1);
    searchPyramidal(pyramidal, val, i + 1, n);
}

pair<int,int> solve(const vector<int>& pyramidal, const vector<int>& odd_pyramidal, const int& val) {
    min_n = MAX_VAL;
    searchPyramidal(pyramidal, val, 0, 0);
    int a = min_n;

    min_n = MAX_VAL;
    searchPyramidal(odd_pyramidal, val, 0, 0);
    int b = min_n;

    return make_pair(a, b);
}

int main() {
    ios::sync_with_stdio(false);

    vector<int> pyramidal;
    vector<int> odd_pyramidal;
    makePyramidal(&pyramidal, &odd_pyramidal, MAX_VAL);

    int val;
    while (true) {
        cin >> val;
        if (val == 0) { break; }
        auto p = solve(pyramidal, odd_pyramidal, val);
        cout << p.first << " " << p.second << endl;
    }

    return 0;
}

C++: #include<cstdio>
#include<functional>
#include<algorithm>
using namespace std;
int dp[1000001],dp2[1000001];
int main(void)
{
	int n,p[10001],i,j,nn,x,a,b;
	for(i=1;i<=1000000;i++)	{
		x=i*(i+1)*(i+2)/6;
		if(x>1000000)	break;
		p[i]=x;
	}
	nn=i;
	dp[0]=0;
	for(i=1;i<=1000000;i++)	dp[i]=i;
	for(i=2;i<nn;i++)	{
		if(p[i]>1000000)	break;
		for(j=0;j<1000000;j++)	{
			if(j+p[i]<=1000000)	{
				dp[j+p[i]]=min(dp[j+p[i]],dp[j]+1);
			}
		}
	}	
	dp2[0]=0;
	for(i=1;i<=1000000;i++)	dp2[i]=i;
	for(i=2;i<=nn;i++)	{
		if(p[i]>1000000)	break;
		if(p[i]%2==1)	{
			for(j=0;j<1000000;j++)	{
				if(j+p[i]<=1000000)	{
					dp2[j+p[i]]=min(dp2[j+p[i]],dp2[j]+1);
				}
			}
		}
	}	

	while(1)	{
		scanf("%d",&n);
		if(n==0)	break;
		a=dp[n];
		b=dp2[n];		
		printf("%d %d\n",a,b);
	}
	return 0;
}

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

using namespace std;

#define MAX 999999

/*void pollock(int po[], int od[]) {
	int i = 1, j = 1;
	while (po[i - 1] < 1000000) {
		po[i] = (i * (i + 1) * (i + 2)) / 6;
		if (po[i] % 2 == 1) {
			od[j] = po[i];
			j++;
		}
		i++;
	}
}*/

int main() {
	vector<int> tmp(1000000, MAX);
	vector<int> odtmp(1000000, MAX);
	tmp[0] = 0, odtmp[0] = 0;
	int t = 1, i = 1;
	while (t <= MAX) {
			for (int j = 0; j + t <= MAX; ++j) {
				tmp[j + t] = min(tmp[j + t], tmp[j] + 1);
				if (t % 2 == 1) odtmp[j + t] = min(odtmp[j + t], odtmp[j] + 1);
			}
			i++;
			t = (i * (i + 1) * (i + 2)) / 6;
		}
	int n;
	while (cin >> n && n) {
		cout << tmp[n] << " " << odtmp[n] << endl;
	}

	return 0;
}

C++: #include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

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


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	vector < vector<bool> >dp(6, vector < bool>(1000001, 0));
	dp[0][0] = 1;
	REP(i, 5) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if (k > 100001)break;
			REP(l, 100001 - k) {
				if (dp[i][l])dp[i + 1][l + k] = 1;
			}
		}
	}
	vector<vector<bool>> dp2(1001, vector<bool>(1000001, 0));
	REP(i, 100) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if (k % 2 == 0)continue;
			if (k > 100001)break;
			REP(l, 100001 - k) {
				if (dp2[i][l])dp2[i + 1][l + k] = 1;
			}
		}
	}
	while (1) {
		int n;
		cin >> n;
		if (!n)break;
		REP(i, 5) {
			if (dp[i + 1][n]) {
				cout << i + 1;
				break;
			}
		}
		cout << " ";
		REP(i, 100) {
			if (dp2[i + 1][n]) {
				cout << i + 1 << endl;
				break;
			}
		}
	}
	return 0;
}