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>
#include <cstdlib>
#include <algorithm>
#include <climits>
#include <cmath>
#include <queue>
#include <utility>
using namespace std;

using P = pair<int, int>;
using Iterator = vector<int>::iterator;
vector<int> s;
vector<int> odd_s;

void make_shimentai(){
    for(int i = 1; ; ++i){
        int sum = i * (i + 1) * (i + 2) / 6;

        if(sum >= 1000000) break;

        s.emplace_back(sum);

        if(sum % 2 == 1) odd_s.emplace_back(sum);
    }
}

int bfs(const int v, Iterator it, vector<int> &s){
    // first:????¨????, second:?¶????????????°
    queue<P> q;
    q.push(make_pair(*it, 1));

    while(!q.empty()){
        P p = q.front(); q.pop();
        if(p.first == v) return p.second;

        for(Iterator it_ = s.begin(); it_ <= it; ++it_){
            int sum = p.first + *it_;
            if(sum <= v)
                q.push(make_pair(sum, p.second + 1));
        }
    }
    return -1;
}

int solve(const int v, vector<int> &s){
    Iterator it = lower_bound(s.begin(), s.end(), v);
    if(*it != v) it--;

    int ans = INT_MAX;

    for(;it != s.begin() - 1; --it){
        ans = min(ans, bfs(v, it, s));
        if(ans == 1) break;
    }

    return ans;
}

/*int solve(const int v, vector<int> s){
  decltype(s)::iterator it = lower_bound(s.begin(), s.end(), v);
  if(*it != v) it--;

  int ans = INT_MAX;
  for(;it != s.begin()-1; it--){
  vector<int>::iterator it_ = it;
  int v_ = v;
  int count = 0;
  while(true){
  if(v_ == 0) break;
  if(v_ - *it_ < 0){
  it_--;
  continue;
  }

  v_ -= *it_;
  count++;
  if(ans < count) break;
  }
  ans = min(ans, count);
  }

  return ans;
  }*/

int main(){
    make_shimentai();

    while(true){
        int v;
        cin >> v;
        if(v == 0) break;

        int ans = solve(v, s);
        cout << ans << " ";
        ans = solve(v, odd_s);
        cout << ans << "\n";
    }

    return EXIT_SUCCESS;
}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const int N = 1000000;
const int mod = 1000000007;
const int INF = 1 << 30;
#define rep(i,n) for(int i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define fix(n) fixed<<setprecision(n)
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll ss[5000];//正四面体数
vector<ll>v;
ll dp[1000000],dp2[1000000];
int main() {
	v.pb(1);
	ll n,now=1;
	rep(i, 5000) {
		ss[i] = (ll)i*(i + 1)*(i + 2) / 6;
		if (ss[i] % 2 == 1)v.pb(ss[i]);
	}
	rep(i, 100000) {
		if (i < 2) { dp[i] = i; continue; }
		if (i >= ss[now + 1])++now;
		dp[i] = i / ss[now] + dp[i%ss[now]];
		for (int j = now - 1; j >= 1; --j)dp[i] = min(dp[i], i / ss[j] + dp[i%ss[j]]);
	}
	now = 1;
	rep(i, 100000) {
		if (i < 2) { dp2[i] = i; continue; }
		if (i >= v[now + 1])++now;
		dp2[i] = i / v[now] + dp2[i%v[now]];	
		for (int j = now - 1; j >= 1; --j)dp2[i] = min(dp2[i], i / v[j] + dp2[i%v[j]]);
	
	}
	while (cin >> n, n) {
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}

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[3][1000000];
int dp2[3][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){
		int n = (i+1)&1,c = i&1;
		rep(j,1000000){
			dp1[2][j] = dp1[n][j] = dp1[c][j];
			if(j>=v1[i+1])
				dp1[2][j] = dp1[n][j] = min(dp1[n][j], dp1[n][j-v1[i+1]] + 1);
		}
	}
	rep(i,v2.size()-1){
		int n = (i+1)&1, c = 1&i;
		rep(j,1000000){
			dp2[2][j] = dp2[n][j] = dp2[c][j];
			if(j>=v2[i+1])
				dp2[2][j] = dp2[n][j] = min(dp2[n][j], dp2[n][j-v2[i+1]]+1);
		}
	}
	int n;
	while(cin>>n,n){
		cout << dp1[2][n] << " " << dp2[2][n] << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1000001];
int memo2[1000001];
 
int solve(int n){

  if(!n) return 0;
  if(memo[n]) return memo[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n; i++) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(memo2[n]) return memo2[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n;i++){
    if(p[i]&1) ans = min(ans, solve2(n-p[i])+1);
  }
   
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  for(int i=0;i<181;i++) p[i] = i*(i+1)*(i+2)/6;
  for(int i=1;i<=1000000;i+=10000) solve(i), solve2(i);
   
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
}