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>

int tetrahedral_number (int n)
{
    return (n * (n + 1) * (n + 2)) / 6;
}

int vector_sum (std::vector<int>* vec)
{
    int num = 0;
    for (int i = 0; i < vec->size (); i++)
    {
        num = num + (*vec)[i];
    }

    return num;
}

std::vector<int>* approx_least_number_by_tetrahedral (int n)
{
    int tmp_n = n;
    std::vector<int>* solution = NULL;

    while (tmp_n != 0)
    {

        int i = 0;

        while (i++, tetrahedral_number (i + 1) <= tmp_n);

        if (solution == NULL)
        {
            solution = new std::vector<int> (i);
        }

        (*solution)[i-1] = (*solution)[i-1] + 1;

        tmp_n = tmp_n - tetrahedral_number (i);

    }

    return solution;
}

std::vector<int>* approx_odd_least_number_by_tetrahedral (int n)
{
    int tmp_n = n;
    std::vector<int>* solution = NULL;

    while (tmp_n != 0)
    {

        int i = 1;

        int cnt = 0;

        int odd_i = 0;

        for (int tetra_num = 1; tetra_num <= tmp_n; tetra_num = tetrahedral_number (i))
        {

            if (tetrahedral_number (i) % 2 != 0)
            {
                cnt++;
                odd_i = i;

            }

            i++;
        }

        if (solution == NULL)
        {
            solution = new std::vector<int> (cnt);
        }

        (*solution)[cnt-1] = (*solution)[cnt-1] + 1;

        tmp_n = tmp_n - tetrahedral_number (odd_i);

    }

    return solution;

}

std::vector<int>* odd_branch_and_bound (std::vector<int>* base, int n)
{

    int upper_b = vector_sum (base);

    int v_dim = base->size ();

    auto tetra_indices = new std::vector<int> (v_dim);

    int n_copy = n;

    while (n_copy != 0)
    {

        int i = 1;

        int cnt = 0;

        int odd_i = 0;

        for (int tetra_num = 1; tetra_num <= n_copy; tetra_num = tetrahedral_number (i))
        {

            if (tetrahedral_number (i) % 2 != 0)
            {
                cnt++;
                odd_i = i;

            }

            i++;
        }


        (*tetra_indices)[cnt-1] = odd_i;

        int tetra_num = tetrahedral_number (odd_i);

        while (n_copy >= tetra_num)
        {
            n_copy = n_copy - tetra_num;
        }

    }

    auto f = [&](int upper_bound, int upper_index) -> std::vector<int>*
    {
        int cnt = 1;


        std::vector<int>* target = new std::vector<int> (upper_index);

        (*target)[upper_index-1] = 1;

        int tmp_n = n - tetrahedral_number ((*tetra_indices)[upper_index-1]);

        while (tmp_n != 0)
        {

            int i = 0;

            while (i++, tetrahedral_number ((*tetra_indices)[i]) <= tmp_n && i < upper_index);

            
            (*target)[i-1] = (*target)[i-1] + 1;

            cnt++;

            if (cnt >= upper_bound)
            {
                return NULL;
            }

            tmp_n = tmp_n - tetrahedral_number ((*tetra_indices)[i-1]);

        }


        return target;
    };

    std::vector<int>* solution = base;

    for (int i = solution->size () - 1; i > 0; i--)
    {


        auto vec = f (vector_sum (solution), i);


        if (vec !=NULL)
        {
            solution = vec;
        }

    }


    return solution;
}


std::vector<int>* branch_and_bound (std::vector<int>* base, int n)
{

    int upper_b = vector_sum (base);

    auto f = [](std::vector<int>* base, int n, int index) -> std::vector<int>*
    {
        int cnt = 1;

        int upper_cnt = vector_sum (base);

        std::vector<int>* solution = new std::vector<int> (index);

        (*solution)[index-1] = 1;

        int tmp_n = n - tetrahedral_number (index);

        while (tmp_n != 0)
        {

            int i = 0;

            while (i++, tetrahedral_number (i + 1) <= tmp_n && i <= index);

            
            (*solution)[i-1] = (*solution)[i-1] + 1;

            cnt++;

            if (cnt >= upper_cnt)
            {
                return NULL;
            }

            tmp_n = tmp_n - tetrahedral_number (i);

        }


        return solution;
    };

    std::vector<int>* solution = base;

    for (int i = solution->size () - 1; i > 0; i--)
    {


        auto vec = f (solution, n, i);


        if (vec !=NULL)
        {
            solution = vec;
        }

    }



    return solution;
}

int main ()
{

    int n = 0;
    while (std::cin >> n, n != 0)
    {

        auto b = approx_least_number_by_tetrahedral (n);

        auto s = branch_and_bound(b,n);
        
        int normal = vector_sum (s);

        auto ob = approx_odd_least_number_by_tetrahedral (n);

        auto os = odd_branch_and_bound (ob, n);

        int odd =vector_sum (os);

        std::cout << normal << " " << odd <<  std::endl;
    }


    return 0;
}