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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1000005,INF=1<<30;
vector<ll> A,B;
int cnt1[MAX],cnt2[MAX];

void BFS(){
    cnt1[0]=0;
    cnt2[0]=0;
    
    queue<ll> Q;
    Q.push(0);
    
    while(!Q.empty()){
        ll a=Q.front();
        Q.pop();
        for(ll to:A){
            if(a+to<=1000000){
                if(cnt1[a+to]==INF){
                    cnt1[a+to]=cnt1[a]+1;
                    Q.push(a+to);
                }
            }
        }
    }
    
    Q.push(0);
    
    while(!Q.empty()){
        ll a=Q.front();
        Q.pop();
        for(ll to:B){
            if(a+to<=1000000){
                if(cnt2[a+to]==INF){
                    cnt2[a+to]=cnt2[a]+1;
                    Q.push(a+to);
                }
            }
        }
    }
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    for(ll i=1;;i++){
        if(i*(i+1)*(i+2)/6>1000000) break;
        if((i*(i+1)*(i+2)/6)%2==1){
            B.push_back((i*(i+1)*(i+2))/6);
        }
        
        A.push_back((i*(i+1)*(i+2))/6);
    }
    
    for(int i=0;i<=1000000;i++){
        cnt1[i]=INF;
        cnt2[i]=INF;
    }
    
    BFS();
    
    while(1){
        int N;cin>>N;
        if(N==0) break;
        
        cout<<cnt1[N]<<" "<<cnt2[N]<<endl;
    }
    
}

C++: #include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<numeric>

#define INF (1<<28)
#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=(j);i<=(k);i++)
#define fs first
#define sc second
#define pb push_back

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;

int dp1[181][1000000];
int dp2[181][1000000];
int main(){
	vi v1,v2;
	for(int i=1;;i++){
		int t = i * (i+1) * (i+2) / 6;
		if (t > 1000000) break;
		v1.pb(t);
		if(t&1)v2.pb(t);
	}
	rep(i,1000000) dp1[0][i] = dp2[0][i] = i;
	rep(i,v1.size()-1){
		rep(j,1000000){
			dp1[i+1][j] = dp1[i][j];
			if(j>=v1[i+1])
				dp1[i+1][j] = min(dp1[i+1][j], dp1[i+1][j-v1[i+1]] + 1);
		}
	}
	rep(i,v2.size()-1){
		rep(j,1000000){
			dp2[i+1][j] = dp2[i][j];
			if(j>=v2[i+1])
				dp2[i+1][j] = min(dp2[i+1][j], dp2[i+1][j-v2[i+1]]+1);
		}
	}
	int n;
	while(cin>>n,n){
		cout << dp1[v1.size()-1][n] << " " << dp2[v2.size()-1][n] << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
const int MAX = 1000000;
const int INF = (1 << 30);

int main()
{
  vector<int> dp(MAX, INF), odddp(MAX, INF);
  dp.at(0) = 0;
  odddp.at(0) = 0;
  for (int i = 1;; i++)
  {
    int num = (i * (i + 1) * (i + 2)) / 6;
    if (num >= MAX)
    {
      break;
    }
    for (int j = num; j < MAX; j++)
    {
      dp.at(j) = min(dp.at(j), dp.at(j - num) + 1);
      if (num & 1)
      {
        odddp.at(j) = min(odddp.at(j), odddp.at(j - num) + 1);
      }
    }
  }
  while (1)
  {
    int n;
    cin >> n;
    if (!n)
    {
      break;
    }
    cout << dp.at(n) << " " << odddp.at(n) << endl;
  }
}

C++: // 模範解答

#include <iostream>
#include <vector>
using namespace std;

const int MAX = 1000100;
const int INF = 1<<29;

int main() {
    vector<int> dp(MAX, INF), odddp(MAX, INF);
    dp[0] = odddp[0] = 0;
    for (int i = 1;; ++i) {
        int num = i * (i+1) * (i+2) / 6;
        if (num >= MAX) break;
        for (int j = num; j < MAX; ++j) {
            dp[j] = min(dp[j], dp[j-num]+1);
            if (num & 1) odddp[j] = min(odddp[j], odddp[j-num]+1);
        }
    }
    int n;
    while (cin >> n) {
        if (n == 0) break;
        cout << dp[n] << " " << odddp[n] << endl;
    }
}

C++: #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;

ll dp[100][1000010];
ll dp2[100][1000010];
int main(void){
    ll n,i,j;
    while(cin >> n && n){
        std::vector<ll> v,v2;
        for(i=1;(i*(i+1)*(i+2)/6)<=n;i++){
            v.push_back(i*(i+1)*(i+2)/6);
            if((i*(i+1)*(i+2)/6)%2)v2.push_back(i*(i+1)*(i+2)/6);
        }
        ll vs = v.size();
        
        fill(dp[0],dp[0]+(vs+1)*(n+1),1000000);
        //cout << dp[0][0] << endl;
        dp[0][0]=0;
        
        for(i=1;i<=vs;i++){
            for(j=0;j<=n;j++){
                if(j-v[i-1]<0)dp[i][j]=dp[i-1][j];
                else dp[i][j]=min(dp[i][j-v[i-1]]+1,dp[i-1][j]);
            }
        }
        
        ll ret1 = dp[vs][n];//直にやるほう
        vs = v2.size();
        fill(dp2[0],dp2[0]+(vs+1)*(n+1),1000000);
        dp2[0][0]=0;
        for(i=1;i<=vs;i++){
            for(j=0;j<=n;j++){
                if(j-v2[i-1]<0)dp2[i][j]=dp2[i-1][j];
                else dp2[i][j]=min(dp2[i][j-v2[i-1]]+1,dp2[i-1][j]);
            }
        }
        ll ret2 = dp2[vs][n];
        cout << ret1 << " " << ret2 << endl;
    }
    return 0;
}