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;

int N;

typedef long long ll;

ll f(ll n) {
	return n * (n+1) * (n+2) / 6;
}

vector<int> makeS(int mod, int d) {
	int n = 1;
	vector<int> res;
	while (1) {
		if ( f(n) > N ) break;
		if ( f(n) % mod == d ) {
			res.push_back( f(n) );
		}
		++n;
	}
	return res;
}

const int inf = 1e9;
const int maxN = 1000000;
int dp[maxN+1];
int solve(const vector<int>& s) {
	fill(dp, dp+maxN, inf); dp[0] = 0;
	for (int i = 0; i < s.size(); ++i) {
		for (int j = 0; j <= N; ++j) {
			int nj = j + s[i];
			if (nj <= N) {
				dp[nj] = min(dp[nj], dp[j]+1);
			}
		}
	}
	return dp[N];
}

int main() {
	while (cin >> N, N) {
		vector<int> s0 = makeS(1, 0);
		vector<int> s1 = makeS(2, 1);
		cout << solve(s0) << " " << solve(s1) << endl;
	}
}

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

using namespace std;

int const MAX = 1000000;
int const INF = 1<<29;
int dpa[MAX+1];
int dpo[MAX+1];

int main() {
  
  
  fill(dpa, dpa+MAX, INF);
  fill(dpo, dpo+MAX, INF);
  
  dpa[0] = dpo[0] = 0;
  
  for(int i=1; ; i++) {
    int n = i*(i+1)*(i+2)/6;
    for(int j=n; j<=MAX; j++) {
      dpa[j] = min(dpa[j], dpa[j-n]+1);
      if(n%2) {
	dpo[j] = min(dpo[j], dpo[j-n]+1);
      }
    }
  }
  
  for(int N; cin >> N && N;) {
    cout << dpa[N] << ' ' << dpo[N] << endl;
  }
  
  
  return 0;
}

C++: #include "bits/stdc++.h"
#include <sys/timeb.h>
#include <fstream>

using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define replrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) replrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) a.begin(),a.end()
#define mp make_pair
#define mt make_tuple
#define INF 2000000000
#define INFL 1000000000000000000LL
#define EPS 1e-9
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<P> vP;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<double> > vvd;
typedef vector<vector<P> > vvP;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<P, vector<P>, greater<P> > pqlP;
typedef pair<int, pair<int, int> > Edge;
typedef vector<Edge> vE;
typedef priority_queue<Edge, vector<Edge>, greater<Edge> > pqlE;

int main() {
	vi num(180);
	rep(i, 180) {
		num[i] = (i + 1)*(i + 2)*(i + 3) / 6;
	}
	int N = 1000001;
	vi ans1(N), ans2(N);
	rep(i, N) {
		ans1[i] = ans2[i] = i;
	}
	
	repl(i, 1, 180) {
		repl(j, num[i], N) {
			ans1[j] = min(ans1[j], ans1[j - num[i]] + 1);
		}
	}
	repl(i, 1, 180 / 4) {
		repl(j, num[4 * i], N) {
			ans2[j] = min(ans2[j], ans2[j - num[4 * i]] + 1);
		}

	}

	while (true) {
		int n;
		cin >> n;
		if (n == 0)break;
		cout << ans1[n] << " " << ans2[n] << endl;
	}


	return 0;
}

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

using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const ll INF = 1LL<<60;
const ll m=1LL<<32;

int main(){

  ll n;
  vector<ll>a;
  ll ma=0;
  while(cin>>n){
    if(n==0)break;
    chmax(ma,n);
    a.push_back(n);
  }
  vector<ll>v;
  rep(i,1,190)v.push_back(i*(i+1)*(i+2)/6);
  // out(v[4]);
  // out(v[v.size()-1]);
  ma++;

  ll dp[ma];fill(dp,dp+ma,INF);
  dp[0]=0;
  rep(i,1,ma){
    dp[i]=dp[i-1]+1;
    rep(j,1,v.size()){
      if(i-v[j]>=0)chmin(dp[i],dp[i-v[j]]+1);
    }
  }

  ll d[ma];fill(d,d+ma,INF);
  d[0]=0;
  rep(i,1,ma){
    d[i]=d[i-1]+1;
    rep(j,1,v.size()){
      if(v[j]%2==0)continue;
      if(i-v[j]>=0)chmin(d[i],d[i-v[j]]+1);
    }
  }
  rep(i,0,a.size()){
    out(dp[a[i]]<<" "<<d[a[i]]);
  }




  return 0;
}