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: def NtoY(N):
    D = (N-1)//10 + 1
    Y = (D-1)//365 + 1
    return(Y)

while True:
    n = int(input().strip())
    if n == 0:
        break
    elif n == 1:
        print(NtoY(1))
    elif n == 2:
        print(NtoY(2))
    else:
        lst = [0 for i in range(0,n+1)]
        lst[0] = 1
        lst[1] = 1
        lst[2] = 2
        for i in range(0,n-2):
            lst[i+3] = lst[i+2] + lst[i+1] + lst[i]
        print(NtoY(lst[n]))

Python: # -*- coding: utf-8 -*-

steps = []
step = int(input())
while step != 0:
    steps.append(step)
    step = int(input())

max_step = max(steps)
nums = [1,2,4] + [0 for _ in range(3,max_step)]
for i in range(3,max_step):
    nums[i] = nums[i-1] + nums[i-2] + nums[i-3]

for step in steps:
    year_minus = nums[step-1] // -3650
    print(str(-year_minus))

Python: def tribonacci(n):
    if n == 0:
        return 1
    if n == 1:
        return 1
    if n == 2:
        return 2
    else:
        return tribonacci(n-1)+tribonacci(n-2)+tribonacci(n-3)
    
while True:
    n = int(input())
    if n == 0:
        break
    print((tribonacci(n)//(365*10))+1)

Python: import math
stage = int(input())
while True:
    ans = [0 for n in range(stage)]
    for n in range(stage):
        if n == 0:
            try:
                ans[0] += 1
                ans[1] += 1
                ans[2] += 1
            except:
                pass
        else:
            if n - 3 < 0:
                ans[n] = ans[n] + sum(ans[:n])
            else:
                ans[n] = sum(ans[n-3:n])
    print(math.ceil(ans[-1] / 3650))
    stage = int(input())
    if stage ==0:
        break

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>1:
            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=input()
        if inp==0:
            break
        print(solve(inp))

main()

Python: import math

N=[]
for _ in range(30):
  n=int(input())
  if n==0: break
  N.append(n)

for n in N:
  dp=[0]*31
  dp[0]=1
  dp[1]=1
  dp[2]=2
  for i in range(3,n+1):
    dp[i]=dp[i-1]+dp[i-2]+dp[i-3]
  print(math.ceil(dp[n]/10/365))

Python: #演習2-5　Kannnondo
while True:
    n=int(input())
    if n==0:
        break
    else:
        A=[0]*40
        A[0],A[1],A[2]=1,1,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: def solve(N):
    dp = [0] * (N + 1)

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

    d = (dp[N] // 10 + int(dp[N] % 10 != 0))
    print(d // 365 + int(d % 365 != 0))


N = int(input())
while N != 0:
    solve(N)
    N = int(input())

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

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

    for i in range(1, n+1):
        dp[i] += dp[i-1]
        if i > 1:
            dp[i] += dp[i - 2]
        if i > 2:
            dp[i] += dp[i - 3]
    print((dp[-1]//10 + 1) // 365 + 1)

Python: LENGTH = 30


def calculate_step(length):
    step_list = [0] * (length + 1)
    step_list[1] = 1
    step_list[2] = 2
    step_list[3] = 4

    for lp in range(4, length + 1):
        total = sum(step_list[lp - 3:lp])
        step_list[lp] = total

    return step_list


step_list = calculate_step(LENGTH)
step_list = [int(item / 10 / 365 + 1) for item in step_list]

while True:

    step = int(input())

    if step == 0:
        break

    print(step_list[step])