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]])
	}
}

Python: import sys
input = sys.stdin.readline


def inpl():
    return list(map(int, input().split()))


def main():
    max_p = 10**6
    dp_all = [1000] * (max_p + 1)
    dp_odd = dp_all.copy()
    dp_all[0] = 0
    dp_odd[0] = 0

    pollocks = [i * (i + 1) * (i + 2) // 6 for i in range(1, 181)]

    for i in range(max_p):
        for p in pollocks:
            if i + p > max_p:
                break
            if dp_all[i + p] > dp_all[i] + 1:
                dp_all[i + p] = dp_all[i] + 1
            if p % 2 and dp_odd[i + p] > dp_odd[i] + 1:
                dp_odd[i + p] = dp_odd[i] + 1

    while True:
        p = int(input())
        if p == 0:
            break
        print(dp_all[p], dp_odd[p])


main()

Python: # -*- coding: utf-8 -*-
from bisect import bisect_left, bisect

def solve():
    i = 1
    P = []
    x = 1
    M = 10**6
    while x < M:
        P.append(x)
        i += 1
        x = (i)*(i+1)*(i+2)//6
    
    P = P[1:]
    Q = [p for p in P if p%2]
    DP1 = list(range(M+1))
    DP2 = list(range(M+1))
    
    for i in range(M):
        for p in P[:bisect(P, M-i)]:
            DP1[i+p] = min(DP1[i+p], DP1[i]+1)
        for q in Q[:bisect(Q, M-i)]:
            DP2[i+q] = min(DP2[i+q], DP2[i]+1)
    
    N = int(input())
    
    while N:
        print("{} {}".format(DP1[N], DP2[N]))
        N = int(input())


if __name__ == "__main__":
    solve()
    exit()

Python: INIT = 100

query = []
ans = []
while True:
  q = int(input())
  if q == 0:
    break
  query.append(q)
MAX = max(query)

table = [INIT] * (MAX + 1)
table[0] = 0
all_item = [i * (i + 1) * (i + 2) // 6 for i in range(1, 181)]
odd_item = [i for i in all_item if i % 2]
eve_item = [i for i in all_item if not i % 2]

for v in odd_item:
  for j in range(v, MAX + 1):
    if table[j] > table[j - v] + 1:
      table[j] = table[j - v] + 1

for q in query:
  ans.append(table[q])

for v in eve_item:
  for j in range(v, MAX + 1):
    if table[j] > table[j - v] + 1:
      table[j] = table[j - v] + 1

for i, q in enumerate(query):
  print(table[q], ans[i])

Python: N=10**6
dp = [i for i in range(N+1)]
odd = [i for i in range(N+1)]
p=4;n=3
while p<=N:
    for i in range(N+1-p):
        dp[i+p]=min(dp[i+p],dp[i]+1)
        if p&1:odd[i+p]=min(odd[i+p],odd[i]+1)
    p=n*(n+1)*(n+2)//6
    n+=1

while 1:
    n=int(input())
    if n==0:break
    print(dp[n],odd[n])

Python: """
tetrahedral = [i*(i+1)*(i+2)//6 for i in range(1,185)]
oddtetrahedral = [i*(i+1)*(i+2)//6 for i in range(1,185,4)]
INF = float("inf")
print(oddtetrahedral)"""
dp = [1e6+1]*(int(1e6)+1)
dpodd = [1e6+1]*(int(1e6)+1)

dp[0] = dpodd[0] = 0

for i in range(1, 181):
    num = i*(i+1)*(i+2)//6
    for j, tpl in enumerate(zip(dp[num:num*3+1], dp), start=num):
        a, b = tpl
        if (b+1 < a):
            dp[j] = b+1
    if (num&1):
        for j, tpl in enumerate(zip(dpodd[num:num*34+1], dpodd), start=num):
            a, b = tpl
            if (b+1 < a):
                dpodd[j] = b+1


"""
for i in range(int(1e6)):
    num = i*(i+1)*(i+2)//6
    if (num>=1e6):
        break
    for j in range(num, int(1e6)):
        dp[j] = min(dp[j], dp[j-num]+1)
        if (num&1):
            dpodd[j] = min(dpodd[j], dpodd[j-num]+1)


dp = [INF]*int(1e6+1)
dpodd = [INF]*int(1e6+1)

for a in tetrahedral:
    if (a > int(1e6)):
        break
    dp[a] = 1
for b in oddtetrahedral:
    if (b > int(1e6)):
        break
    dpodd[b] = 1

for i in range(int(1e6)+1):
    for a in tetrahedral:
        if (i+a <= int(1e6)):
            dp[i+a] = min(dp[i+a], dp[i]+1)
    for b in oddtetrahedral:
        if (i+b <= int(1e6)):
            dpodd[i+b] = min(dpodd[i+b], dpodd[i]+1)
"""

def solve(N):
    return (dp[N], dpodd[N])

"""
    dp = [INF]*(N+1)
    dpodd = [INF]*(N+1)
    for a in tetrahedral:
        if (a > N):
            break
        dp[a] = 1
    for b in oddtetrahedral:
        if (b > N):
            break
        dpodd[b] = 1

    def reca(n):
        if (n < 0):
            return INF
        if (dp[n] != INF):
            return dp[n]
        dp[n] = min([reca(n-a)+1 for a in tetrahedral if (n-a>=0)])
        return dp[n]

    def recb(n):
        if (n < 0):
            return INF
        if (dpodd[n] != INF):
            return dpodd[n]
        dpodd[n] = min([recb(n-b)+1 for b in oddtetrahedral])
        return dpodd[n]

    ret1 = reca(N)
    ret2 = recb(N)
    return (ret1, ret2)
"""

def main():
    ans = []
    while True:
        N = int(input())
        if (N == 0):
            break
        ans.append(solve(N))

    for i in ans:
        print(*i)

main()


"""
    for i in range(N+1):
        for a in tetrahedral:
            if (i+a <= N):
                dp[i+a] = min(dp[i+a], dp[i]+1)
        for b in oddtetrahedral:
            if (i+b <= N):
                dpodd[i+b] = min(dpodd[i+b], dpodd[i]+1)
    return (dp[N], dpodd[N])
"""