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で解く
'''
# DPテーブル
dp = [0] * 31

# 初期値
dp[0] = 1
dp[1] = 1
dp[2] = 2

# dp[30]までの値を記録
for i in range(3, 31):
    dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3]

while True:
    n = int(input())
    if n == 0:
        break
    # 解を出力
    ans = 1 + dp[n] // (365 * 10)
    print(ans)

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

while True:
    tmp = int(input())
    if tmp == 0:
        break
    
    A = [0] * tmp
    A[0] = 1
    if tmp > 1:
        A[1] = A[0] + 1
    if tmp > 2:
        A[2] = A[1] + A[0] + 1
    for i in range(3, tmp):
        A[i] = A[i-3] + A[i-2] + A[i-1]
    print(-(-1*A[-1]//(10*365)))

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

Python: N = []
while 1:
  x = int(raw_input())
  if x==0: break
  N.append(x)
n0 = max(N)-2
A = [1,1,2]+[0]*n0
for i in range(0, n0): A[i+3] = sum(A[i:i+3])
for e in N: print (A[e]+3649)/3650

Python: #!/usr/bin/env python
# -*- coding: utf-8 -*-

dp = [0 for i in range(31)]
dp[1] = 1
dp[2] = 1
dp[3] = 1

for i in range(1,31):
    for j in range(1,4):
        if i-j > 0:
            dp[i] += dp[i-j]

while True:
    N = int(raw_input())
    if N == 0:
        break
    print(int(dp[N]/10//365)+1)

Python: import math

def cal_pattern(n):
  dp = [0]*(n+1)
  dp[0] = 1
  dp[1] = 1
  if n == 1: return dp[-1]
  dp[2] = 2
  for i in range(3, n+1):
    dp[i] = dp[i-1]+dp[i-2]+dp[i-3]
  return dp[-1]

def run(n):
  patterns = cal_pattern(n)
  days = math.ceil(patterns/10)
  print(math.ceil(days/365))
  
if __name__ == '__main__':
  while True:
    n = int(input())
    if n == 0: break
    run(n)

Python: import unittest
from io import StringIO

import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    L=[]
    while True:
        x=int(input())
        if x!=0:
            L.append(x)
        else: break
    M=max(L)


    # https://qiita.com/drken/items/dc53c683d6de8aeacf5a#dp-%E5%AE%9F%E8%A3%85%E3%81%AE%E9%A0%86%E5%BA%8F
    
    
    # dpテーブル dp[i]:= i段目まで登るための通り数
    dp = [0]*(M+1)
    """
    初期化の値は，
        最小化問題：INF, 
        最大化問題：-INF（0以上の値しか取らないなら-1, あるいは0でもいいかも)
        数え上げ問題：0
        確率問題：0
        Yes/No判定問題:False
    """
    
    # 初期条件
    dp[0] = 1
    
    # ループ
    for i in range(1,M+1):
    
        """
        dp[from] の値の更新が完了していればノード from からノード to への緩和を行っていい．貰うdpであれ配るdpであれ．
        両者の違いを意識すべきケースはcf. 
        https://qiita.com/drken/items/ace3142967c4f01d42e9#%E8%B2%B0%E3%81%86-dp-%E3%81%A8%E9%85%8D%E3%82%8B-dp-%E3%81%AE%E6%AF%94%E8%BC%83
        """
    
        dp[i]+=dp[i-1]
        if i>=2:
            dp[i]+=dp[i-2]
        if i>=3:
            dp[i]+=dp[i-3]
        
        
    
    # 出力
    
    for i in L:
        print(-(-dp[i] // 3650))
        
        
resolve()

Python: def solve(n):
    def get_count(n):
        if n < 3:
            return [1, 2, 4][n-1]
        cnt = [0] * (n)
        cnt[0] = 1
        cnt[1] = 2
        cnt[2] = 4
        for i in xrange(3, n):
            cnt[i] += cnt[i-1] + cnt[i-2] + cnt[i-3]
        return cnt[n-1]
    cnt =  get_count(n)
    print (((cnt+9)/10) + 364) / 365

if __name__ == "__main__":
    import sys
    while True:
        n = int(raw_input())
        if not n:
            sys.exit()
        solve(n)

Python: l = [0 for _ in range(31)]
l[1] = 1
l[2] = 2
l[3] = 4

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

while True:
    n = int(input())
    if n == 0:
        break
    else:
        t = l[n]
        if t % 10 == 0:
            d = t // 10
        else:
            d = t // 10 + 1
        if d % 365 == 0:
            print(d // 365)
        else:
            print(d // 365 + 1)