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 <algorithm>
#include <cstdio>
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];
    
    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);
	  //tmp=min(dp[i+coin[j]],dp[i]+1);
	  //dp[i+coin[j]]=tmp;
	}
      }
    }


    //int ans1=dp[x];

  
    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_ki;j++){
	if(i+coin_ki[j]<=x){
	  dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1); 
	  //tmp=min(dp[i+coin_ki[j]],dp[i]+1);
	  //dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    
    //int ans2=dp[x];
    
    printf("%d %d\n",1,2);
  }
  return 0;
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;

const int MAX_N = 1000000;
const int INF = 1 << 29;

void solve(int n)
{
	int dp[MAX_N], dp_odd[MAX_N];
	fill_n(dp, n + 1, INF);
	fill_n(dp_odd, n + 1, INF);
	
	dp[0] = 0;
	dp_odd[0] = 0;
	REP(i, 100) {
		int m = (i + 1) * (i + 2) * (i + 3) / 6;
		if(m > n) break;
		FOR(j, m, n + 1) {
			if(m % 2) dp_odd[j] = min(dp_odd[j], dp_odd[j - m] + 1);
			dp[j] = min(dp[j], dp[j - m] + 1);
		}
	}
	
	printf("%d %d\n", dp[n], dp_odd[n]);
}

int main()
{
	int n;
	
	while (scanf("%d", &n), n) solve(n);
	return 0;
}

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

#define pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using comd = complex<double>;
using pii = pair<int,int> ;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

double CalcDist(comd p1, comd p2){
  return sqrt(pow(p1.X - p2.X,2.0) + pow(p1.Y -p2.Y,2.0));
}

template <typename T>
void out(deque < T > d)
{
  for(size_t i = 0; i < d.size(); i++)
  {
    debug(d[i]);
  }
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}
int n,res =inf;
vector<vector<int>> dp;
int solve(int a,int b,int c,vector<int> v){
  if(dp[c][b] != inf){
    return dp[c][b];
  }
  if(b == 0) res = inf;
  if(a == n){
    res = min(res,b);
    dp[c][b] = min(res,dp[c][b]);
    return res;
  }
  if(a > n || res < b) return inf;
  else{
    REP(i,c,v.size()){
      res = min(solve(a+v[i],b+1,i,v),res);
    }
    dp[c][b] = min(res,dp[c][b]);
  }
  return res;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int tmp=0,k = 1;
  vector<int> suqnum(0),odd(0);
  while(tmp < 1000000){
    tmp = k * (k + 1) * (k + 2) / 6;
    suqnum.pb(tmp);
    if(tmp%2==1){
      odd.pb(tmp);
    }
    ++k;
  }
  reverse(all(suqnum));
  reverse(all(odd));
  while(cin >> n){
    if(n == 0)break;
    int lb1= 0 ,lb2 = 0;
    rep(i,suqnum.size()){
      if(suqnum[i] <= n){
        lb1 = i;
        break;
      }
    }
    rep(i,odd.size()){
      if(odd[i] <= n){
        lb2 = i;
        break;
      }
    }
    const int Max = 1000;
    dp = vector<vector<int>>(Max,vector<int>(Max,inf));
    cout << solve(0,0,lb1,suqnum)<< " " ;
    dp = vector<vector<int>>(Max,vector<int>(Max,inf));
    cout << solve(0,0,lb2,odd) << endl;
//     queue<pii> q;
//     q.push(make_pair(0,0));
//     while(!q.empty()){
//       pii p = q.front();q.pop();
//       REP(i,lb1,suqnum.size()){
//         if(p.se+suqnum[i] == n){
//           cout << p.fi+1<< " ";
//           q = queue<pii>();
//           break;
//         }
//         else if(p.se+suqnum[i] < n){
//           q.push(make_pair(p.fi+1,p.se+suqnum[i]));
//         }
//       }
//     }
//     q.push(make_pair(0,0));
//     while(!q.empty()){
//       pii p = q.front();q.pop();
//       REP(i,lb2,odd.size()){
//         if(p.se+odd[i] == n){
//           cout << p.fi+1<< endl;
//           q = queue<pii>();
//           break;
//         }
//         else if(p.se+odd[i] < n){
//           q.push(make_pair(p.fi+1,p.se+odd[i]));
//         }
//       }
//     }
  }
  return 0;
}