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 <cstdio>
#include <algorithm>
using namespace std;

int n;
int memo1[1000001], memo2[1000001], memoodd[1000001], memo3[1000001];

int pollock_1(int n)
{
    int min = 100, ex;
    if (n == memo1[n])
        return memo2[n] = 1;
    if (memo2[n] > 0)
        return memo2[n];
    for (int i = 1; i < 1000001; i++)
    {
        if (i <= n / 2)
        {
            if (pollock_1(n - i) == 1)
            {
                ex = pollock_1(n - i) + pollock_1(i);
            }
            if (i == 1)
            {
                ex = pollock_1(n - 1) + 1;
            }
            if (ex < min)
                min = ex;
        }
    }
    return memo2[n] = min;
}

int pollock_2(int n)
{
    int min = 10000000, ex;
    if (n == memoodd[n])
        return memo2[n] = 1;
    if (memo3[n] > 0)
        return memo3[n];
    for (int i = 1; i < 1000001; i++)
    {
        if (i <= n / 2)
        {
            if (pollock_2(n - i) == 1)
            {
                ex = pollock_2(n - i) + pollock_2(i);
            }
            if (i == 1)
            {
                ex = pollock_2(n - 1) + 1;
            }
            if (ex < min)
                min = ex;
        }
    }
    return memo3[n] = min;
}

int main()
{
    for (int k = 0; k < 1000001; k++)
    {
        memo1[k] = 0;
        memo2[k] = 0;
        memoodd[k] = 0;
        memo3[k] = 0;
    }
    for (int k = 1; k < 200; k++)
    {
        n = (k * (k + 1) * (k + 2)) / 6;
        memo1[n] = n;
        if (n % 2 != 0)
            memoodd[n] = n;
    }
    while (1)
    {
        scanf("%d", &n);
        if (n == 0)
            break;
        printf("%d %d\n", pollock_1(n), pollock_2(n));
    }
}