Go: package main

import (
	"bufio"
	"fmt"
	"math/big"
	"os"
	"strconv"
)

func CountPatterns(i int, patternNums []int) int {
	if patternNums[i] != 0 {
		return patternNums[i]
	}
	if i == 0 {
		return 1
	}
	patternNums[i] += CountPatterns(i-1, patternNums)
	if i > 1 {
		patternNums[i] += CountPatterns(i-2, patternNums)
	}
	if i > 2 {
		patternNums[i] += CountPatterns(i-3, patternNums)
	}
	return patternNums[i]
}

func Solve(N int) int {
	patternNums := MakeFilledInts(N+1, 0)
	return (CountPatterns(N, patternNums) + 3649) / 3650
}

func main() {
	for N := scan.Int(); N != 0; N = scan.Int() {
		ans := Solve(N)
		fmt.Println(ans)
	}
}

// --------------------------------------------------------------------------------
// Input

var scan = NewScanner()

type Scanner struct{ *bufio.Scanner }

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(nil, 100000000)
	return &Scanner{sc}
}

func (s *Scanner) String() string {
	s.Scan()
	return s.Text()
}

func (s *Scanner) Strings(l int) []string {
	if l == 0 {
		return []string{}
	}
	sl := make([]string, l, l)
	for i := range sl {
		sl[i] = s.String()
	}
	return sl
}

func (s *Scanner) Int() int {
	n, _ := strconv.Atoi(s.String())
	return n
}

func (s *Scanner) Ints(l int) []int {
	if l == 0 {
		return []int{}
	}
	sl := make([]int, l, l)
	for i := range sl {
		sl[i] = s.Int()
	}
	return sl
}

func (s *Scanner) Int64() int64 {
	n, _ := strconv.ParseInt(s.String(), 10, 64)
	return n
}

func (s *Scanner) BigInt() *big.Int {
	return big.NewInt(s.Int64())
}

func (s *Scanner) BigInts(l int) []*big.Int {
	if l == 0 {
		return []*big.Int{}
	}
	sl := make([]*big.Int, l, l)
	for i := range sl {
		sl[i] = s.BigInt()
	}
	return sl
}

func (s *Scanner) Float64() float64 {
	f, _ := strconv.ParseFloat(s.String(), 64)
	return f
}

func (s *Scanner) Floats64(l int) []float64 {
	if l == 0 {
		return []float64{}
	}
	sl := make([]float64, l, l)
	for i := range sl {
		sl[i] = s.Float64()
	}
	return sl
}

// --------------------------------------------------------------------------------
// Output

const (
	Yes = "Yes"
	No  = "No"

	YES = "YES"
	NO  = "NO"
)

func PrintBool(v bool, trueStr, falseStr string) {
	if v {
		fmt.Println(trueStr)
	} else {
		fmt.Println(falseStr)
	}
}

// --------------------------------------------------------------------------------
// sort.BigIntSlice

type BigIntSlice []*big.Int

func (sl BigIntSlice) Len() int {
	return len(sl)
}

func (sl BigIntSlice) Less(i, j int) bool {
	return sl[i].Cmp(sl[j]) == -1
}

func (sl BigIntSlice) Swap(i, j int) {
	sl[i], sl[j] = sl[j], sl[i]
}

// --------------------------------------------------------------------------------
// Mint

const (
	Mod = 1000000007
)

type Mint int

func NewMint(value int) Mint {
	return Mint((value%Mod + Mod) % Mod)
}

func (x Mint) Add(y Mint) Mint {
	if v := x + y; v >= Mod {
		return v - Mod
	} else {
		return v
	}
}

func (x Mint) Sub(y Mint) Mint {
	if v := x + Mod - y; v >= Mod {
		return v - Mod
	} else {
		return v
	}
}

func (x Mint) Mul(y Mint) Mint {
	return (x * y) % Mod
}

func (x Mint) pow(n int) Mint {
	if n == 0 {
		return Mint(1)
	}
	a := x.pow(n >> 1)
	a = a.Mul(a)
	if n&1 != 0 {
		a = a.Mul(x)
	}
	return a
}

func (x Mint) Inverse() Mint {
	return x.pow(Mod - 2)
}

func (x Mint) Div(y Mint) Mint {
	return x * y.Inverse()
}

func (x Mint) Neg() Mint {
	return NewMint(int(-x))
}

// --------------------------------------------------------------------------------
// Factorial

type Factorial struct {
	fact        []Mint
	factInverse []Mint
}

func NewFactorial(n int) *Factorial {
	f := new(Factorial)
	f.init(n)
	return f
}

func (f *Factorial) init(n int) {
	fact := make([]Mint, n+1, n+1)
	fact[0] = NewMint(1)
	for i := 1; i <= n; i++ {
		fact[i] = fact[i-1].Mul(NewMint(i))
	}

	inv := make([]Mint, n+1, n+1)
	inv[n] = fact[n].Inverse()
	for i := n; i >= 1; i-- {
		inv[i-1] = inv[i].Mul(NewMint(i))
	}

	f.fact = fact
	f.factInverse = inv
}

func (f *Fa

Python: A = [0 for _ in range(32)]
A[0] = 1
for i in range(1, 32):
    A[i] = A[i-1]
    if i > 1:
        A[i] += A[i-2]
        if i > 2:
            A[i] += A[i-3]

while True:
    n = int(input())
    if n ==0:
        break
    else:
        print(A[n]//3650 + 1)

Python: while True:
    n = int(input())
    if n == 0: break
    a = list(range(n+1))
    a[:4] = [1, 1, 2, 4]
    for i in range(4, n+1):
        a[i] = a[i-1] + a[i-2] + a[i-3]
    print(a[n]//3650 + bool(a[n]%3650))

Python: for i in range(31):
    n = int(input())
    if n == 0:
        break

    d = [1, 1, 2, 4]
    for i in range(4, n+1):
        d.append(d[i-3] + d[i-2] + d[i-1])

    q, r = divmod(d[n], 3650)

    print(q if r == 0 else q + 1)

Python: from math import ceil

INF = int(1e18)
DP = [INF for _ in range(32)]
DP[1] = 1
DP[2] = 1
DP[3] = 2
for i in range(4, 32):
    DP[i] = DP[i - 1] + DP[i - 2] + DP[i - 3]

# print(DP[1:])
while True:
    n = int(input())
    if n == 0:
        break

    print(ceil(DP[n + 1] / 3650))

Python: # AOJ 0168 Kannondou
# Python3 2018.6.18 bal4u

ans = [	0,  1,  2,  4,  7,  13,  24,  44,  81,  149, \
274,  504,  927,  1705,  3136,  5768,  10609,  19513,  35890,  66012, \
121415,  223317,  410744,  755476,  1389537,  2555757,  4700770,  8646064, \
15902591,  29249425, 53798080 ]

while True:
	n = int(input())
	if n == 0: break
	print((ans[n]-1)//3650 + 1)

Python: def kannondou(x):
    dp = [0]*(x+1)
    dp[0] = 1
    for i in range(1, x+1):
        for j in range(1, 4):
            if 0 <= i - j:
                dp[i] += dp[i-j]
    return dp[-1]//3650 + 1

while True:
    a = int(input())
    if a == 0:
        break
    print(kannondou(a))

Python: while True:
    n=int(input())
    if n==0:
        break
    else:
#A(0)=1 A(1)=1 A(2)=2 An=A(n-1)+A(n-2)+A(n-3)
        A=[0]*40
        A[0]=1
        A[1]=1
        A[2]=2
        for i in range (3,31):
            A[i]=A[i-1]+A[i-2]+A[i-3]
        if A[n]%3650==0:
            print(A[n]//3650)
        else:
            print((A[n]//3650)+1)

Python: A=[1,2,4]
for i in range(3,30):
  A.append(A[i-1]+A[i-2]+A[i-3])

while True:
  n=int(input())
  if n==0:
    break
  print(A[n-1]//3650+1)

Python: import sys

dp = [0] * 31
dp[0] = dp[1] = 1
dp[2] = 2

for i in range(3,31):
	dp[i] = dp[i-1] + dp[i-2] + dp[i-3]

for n in sys.stdin:
	n = int(n)
	if n == 0:
		break
	else:
		print((3649+dp[n])//3650)

Python: while True:
    n =int(input())
    if n==0:
        break
    A=[0]*32
    A[0]=0
    A[1]=1
    A[2]=2
    A[3]=4
    for i in range(4,31):
        A[i]=A[i-1]+A[i-2]+A[i-3]
    a=A[n]//3650+1
    print(a)

Python: while True:
    n=int(input())
    if n==0:
        break
    else:
        if n==1:
            print(1)
        elif n==2:
            print(1)
        else:
            A=[0]*(n+1)
            A[0]=1
            A[1]=1
            A[2]=2
            for i in range(3,n+1):
                A[i]=A[i-1]+A[i-2]+A[i-3]
            print(A[n]//3650+1)

Python: # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0168

"""
import sys
from sys import stdin
from math import ceil
input = stdin.readline


def solve(n):
    dp = [[0] * (n+1) for _ in range(n+1)]
    for i in range(min(n+1, 4)):
        dp[0][i] = 1

    for i in range(1, n+1):
        for j in range(n+1):
            if j <= i:
                dp[i][j] = 0
            else:
                t = 0
                for k in range(1, min(j, 4)):
                    t += dp[i-1][j-k]
                dp[i][j] = t

    total = 0
    for d in dp:
        total += d[-1]
    return total


def main(args):
    while True:
        n = int(input())
        if n == 0:
            break

        result = solve(n)
        print(ceil(result / 365 / 10))


if __name__ == '__main__':
    main(sys.argv[1:])