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;
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 n;
vector<long long> dpall(1000100, 1e9);
vector<long long> dpodd(1000100, 1e9);
vector<long long> preall(220, 0);
vector<long long> preodd;

int main() {
    for(int i = 1; i <= 200; ++i) {
        preall.at(i-1) = (i*(i+1)*(i+2))/6;
        if(preall.at(i-1) % 2 != 0) {
            preodd.push_back(preall.at(i-1));
        }
    }
    int oddlen = preodd.size();

    dpall[0] = 0;
    for(int i = 1; i < 200; ++i) {
        for(int j = 0; j <= 1000010; ++j) {
            if(j-preall.at(i-1) >= 0) {
                chmin(dpall[j], dpall[j-preall.at(i-1)]+1);
            }
        }
    }

    dpodd[0] = 0;
    for(int i = 1; i < oddlen; ++i) {
        for(int j = 0; j <= 1000010; ++j) {
            if(j-preodd.at(i-1) >= 0) {
                chmin(dpodd[j], dpodd[j-preodd.at(i-1)]+1);
            }
        }
    }

    while(1) {
        cin >> n;
        if(n == 0) break;
        cout << dpall[n] << " " << dpodd[n] << endl;
    }
}

C++: #include <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
  
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
  
const ll MOD=1e9+7;
const ll INF=1e18;
  
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
 
int dp[1000005][2];
 
int main(){
    for(int i = 1;i <= 1000000;i++){
        dp[i][0] = 10000000;
        dp[i][1] = 10000000;
    }
 
    for(int i = 1; i*(i+1)*(i+2)/6 < 1000000;i++){
        int simen = i*(i+1)*(i+2)/6;
        for(int j = 0; j + simen < 1000000;j++){
            for(int k = 0;k < 2;k++){
                if(k == 1 && simen % 2 == 0) continue;
                dp[j+simen][k] = min(dp[j+simen][k],dp[j][k]+1);
            }
        }
    }
    int n;
    while(true){
        cin >> n;
        if(n == 0) break;
        cout << dp[n][0] << " " << dp[n][1] << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  int i,j,k,b[1000001],c[1000001],a[200],n;
  for(i=0;n[i-1]<1000000;i++)a[i]=i*(i+1)*(i+2)/6;
  for(j=0;j<=1000000;j++)ki[j]=all[j]=j;
  for(j=2;j<i;j++){
    for(k=n[j];k<=1000000;k++){
      b[k]=min(b[k],b[k-a[j]]+1);
      if(n[j]%2){
        c[k]=min(c[k],c[k-a[j]]+1);
      }
    }
  }
while(cin>>n,n){
cout<<b[a]<<' '<<c[a]<<endl;
}
return 0;
}

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <utility>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vec vector
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;

int main(){
    vector<int> v,oddv;
    for(ll i=1;;i++){
        if(i*(i+1)*(i+2)/6<=1000000){
            v.pb(i*(i+1)*(i+2)/6);
        }
        else break;
    }
    int ans1[1000010],ans2[1000010];
    rep(i,0,1000010) ans1[i]=ans2[i]=INF;
    ans1[0]=0; ans2[0]=0;
    rep(i,0,1000000){
        ans1[i]=i; ans2[i]=i;
        for(int j=0;i>=v[j];j++){
            ans1[i]=min(ans1[i-v[j]]+1,ans1[i]);
            if(v[j]%2==1)ans2[i]=min(ans2[i],ans2[i-v[j]]+1);
        }
    }

    int n;
    while(cin>>n&&n){
        cout<<ans1[n]<<" "<<ans2[n]<<endl;
    }
    
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

const double pi  = 2 * acos(0.0);
const double eps = 1e-8;

#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef int Cost;
struct Edge {
  int src, dst; Cost cost;
  Edge(int s, int d, Cost c) : src(s), dst(d), cost(c) {}
};
typedef vector<Edge>  Edges;
typedef vector<Edges> Graph;
typedef vector<Cost>  Array;
typedef vector<Array> Matrix;

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

#define MAX_N 1000000
int memo[MAX_N+1];

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

int solve(int n, bool skip_even) {
  fill(memo, memo+MAX_N+1, 1<<30);
  for (int i = 1; plc(i) <= n; i++) {
    if (skip_even && plc(i) % 2 == 0) continue;
    memo[plc(i)] = 1;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; plc(j) <= i; j++) {
      if (skip_even && plc(j) % 2 == 0) continue;
      memo[i] = min(memo[i], memo[i-plc(j)] + 1);
    }
  }
  return memo[n];
}


int main(void) {
  ios_base::sync_with_stdio(false); cin.tie(0);
  int n;
  while (cin >> n, n) {
    cout << solve(n, false) << " " << solve(n, true) << endl;
  }
  return 0;
}