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: dp = [0]*(31)
dp[0] = 0
dp[1] = 1
dp[2] = 2
dp[3] = 4
ans = [0]*31
ans[1] = 1
ans[2] = 1
ans[3] = 1 
input_line = [-1]*31
for i in range(4,31):
    dp[i] += dp[i-1]+dp[i-2]+dp[i-3]
    if dp[i]%10==0:
        ans[i] = dp[i]//10
    else:
        ans[i] = dp[i]//10+1
for i in range(31):
    if ans[i] % 365 == 0:
        ans[i] = ans[i]//365
    else:
        ans[i] = ans[i]//365+1
for i in range(31):
    input_line[i] = int(input())
    if input_line[i] == 0:
        end = i
        break
for i in range(end):
    print(ans[input_line[i]])

Python: import math

while True:
    N = int(input())
    if N == 0:
        break

    dp = (N+1)*[0]
    dp[0]=1

    for i in range(1,N+1):
        for j in range(1,min(4,i+1)):
            dp[i] += dp[i-j]

    print(math.ceil(dp[N]/3650))

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

Python: import math
a = [1, 2, 4]
while len(a) < 30:
    a.append(sum(a[-3:]))

while True:
    n = int(input())
    if n == 0:
        quit()
    else:
        print(math.ceil(a[n-1] / 10 / 365))

Python: import math

dp = [0,1,2,4]
for j in range(3,30):
    dp.append(dp[j]+dp[j-1]+dp[j-2])

for i in range(30):
    n = int(input())
    if n==0:
        break
    else:
        print(math.ceil(dp[n]/3650))

Python: import sys

n=30
f=[1,1,2,4]
while len(f)<=n:
    f.append(f[-1]+f[-2]+f[-3])


while True:
    n=int(input())
    if n==0:
        sys.exit()

    day=f[n]

    if day%3650==0:
        print(int(day/3650))
    else:
        print(int(day/3650)+1)

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

Python: while 1:
    n=int(raw_input())
    if n==0:break
    if n==1:
        print(1)
        continue
    dp=[0]*(n+1)
    dp[0]=dp[1]=1
    dp[2]=2
    for i in xrange(2,n):
        dp[i+1]=dp[i]+dp[i-1]+dp[i-2]
    print(dp[n]/3650+1)

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

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

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

Python: #coding:utf-8
from __future__ import division,print_function
try:
    input = raw_input
except NameError:
    pass
# 上記のコードはPython2とPython3の違いを一部吸収するためのもの
memo=[0]*31
def solve(x):
    if memo[x]==0:
        if x>0:
            memo[x]=solve(x-1)+solve(x-2)+solve(x-3)
            return memo[x]
        elif x==0:
            memo[x]=1
            return 1
        else:
            return 0
    else:
        return memo[x]

def main():
    while True:
        inp=int(input())
        if inp==0:
            break
        print((solve(inp)-1)//3650+1)

main()