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>
#define MAX 1000000
#define INF 1000000000
using namespace std;

int dp1[MAX+1],dp2[MAX+1];

int main(){
    //INFで初期化
    for(int i = 1;i <= MAX;i++){
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1;n * (n + 1) * (n + 2) /6 <= MAX;n++){
        int a = n * (n + 1) * (n + 2) / 6;  //ポロック数の生成
        for(int i = a;i <= MAX;i++){     //正四面体数の個数dp(a以下は必要ない)
            dp1[i] = min(dp1[i],dp1[i-a] + 1);  //更新しないor左側から更新する
        }
        if(a % 2 == 0)continue;     //偶数の時は次のroopへ
        for(int i = a;i <= MAX;i++){     //奇数の正四面体数の個数dp(a以下は必要ない)
            dp2[i] = min(dp2[i],dp2[i-a] + 1);  //更新しないor左側から更新する
        }
    }

    //入出力
    while(true){
        int n;
        cin >> n;
        if(n == 0)break;
        cout << dp1[n] << " " << dp2[n] << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>

#define INF 1e7

using namespace std;

int main(){
	vector<int> t(1,0),t1(1,0);
	int c=1;
	while(t[c-1]<=(int)1e6){
		int temp;
		temp=c*(c+1)*(c+2)/6;
		t.push_back(temp);
		if(temp%2==1 ){
			t1.push_back(temp);
		}
		c++;
	}
	while(true){
		int n;
		cin >> n;
		if(n==0)break;
		
		int num,num1;
		num=distance(t.begin(),upper_bound(t.begin(),t.end(),n)-1);
		num1=distance(t1.begin(),upper_bound(t1.begin(),t1.end(),n)-1);

		vector<vector<int> > s(num+1,vector<int>(n+1,INF));
		vector<vector<int> > s1(num1+1,vector<int>(n+1,INF));
		
		for(int i=0;i<=n;i++){
			s[0][i]=0;
			s[0][i]=0;
			s[1][i]=i;
			s1[1][i]=i;
		}
		for(int i=0;i<=num;i++) s[i][0]=0;
		for(int i=0;i<=num1;i++) s1[i][0]=0;

		for(int i=2;i<=num;i++){
			for(int j=1;j<=n;j++){
				if(j-t[i]>=0){
					s[i][j]=min(s[i-1][j],s[i][j-t[i]]+1);
				}
				else s[i][j]=s[i-1][j];
			}
		}

		for(int i=2;i<=num1;i++){
			for(int j=1;j<=n;j++){
				if(j-t1[i]>=0){
					s1[i][j]=min(s1[i-1][j],s1[i][j-t1[i]]+1);
				}
				else s1[i][j]=s1[i-1][j];
			}
		}
		/*
		for(int i=0;i<s.size();i++){
			for(int j=0;j<s[i].size();j++){
				if(s[i][j]==INF) cout << "0";
				else cout << s[i][j];
				cout << " ";
			}
			cout << endl;
		}
		*/
		cout << s[num][n] << " " << s1[num1][n] << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }
    ////
    int dp[100000];
    //fill(dp,dp + x+1,100000);
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count-1;j++){
	if(i+coin[j]<=x){
	  dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	}
      }
    }

    //cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	}
      }
    }
   
    //cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}

C++: #include "bits/stdc++.h"
 
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<int,int> pii;
// #define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++) 
#define REP(i,n) for(int i = 0;i < (n) ; i++) 
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
template<class T>
inline bool chmax(T &a, T b){
	if(a < b){
		a = b;
		return true;
	}
	return false;
}
template<class T>
inline bool chmin(T &a, T b){
	if(a > b){
		a = b;
		return true;
	}
	return false;
}
/*----------------------------------------------------------------*/

// int MOD = 998244353;
int MOD = 1000000007;
const int M = 1000000;
vector<int> dp(M+10);
vector<int> dpodd(M+10);
vector<int> num;
vector<int> numodd;
/*----------------------------------------------------------------*/
signed main(){

	for(int i = 1;;i++){
		int x = i*(i+1)*(i+2)/6;
		if(x > M)break;
		num.pb(x);
		if(x%2 == 1)numodd.pb(x);
	}
	rep(i,M)dp[i+1] = dpodd[i+1] = INTINF;
	rep(i,M){
		for(auto x:num){
			if(i+x > M)break;
			chmin(dp[i+x],dp[i]+1);
		}
		for(auto x:numodd){
			if(i+x > M)break;
			chmin(dpodd[i+x],dpodd[i]+1);
		}
	}
	
    while(1){
		int n;
		cin >> n;
		if(n == 0)return 0;
		cout << dp[n] << " " << dpodd[n] << endl;
	}

	return 0;
}
/*----------------------------------------------------------------*/

// g++ -std=c++14 code1.cpp
// sudo pip3 install --upgrade online-judge-tools
// rm -r -f test;oj dl https://code-festival-2018-quala.contest.atcoder.jp/tasks/code_festival_2018_quala_c
// rm -r -f test;oj dl https://pakencamp-2019-day3.contest.atcoder.jp/tasks/pakencamp_2019_day3_c
// rm -r -f test;oj dl https://pakencamp-2019-day3.contest.atcoder.jp/tasks/pakencamp_2019_day3_d