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: for i in range(30):
    n = int(input())
    if n == 0:
        break

    INF = 105 * 10 ** 7
    dp = [0] * 100010

    dp[0] = 1
    dp[1] = 2
    dp[2] = 4

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

    years = dp[n-1] // 3650  + 1 if dp[n-1] % 3650 else dp[n-1] // 3650
    print(years)

Python: while True:
  n = int(input())
  if n==0:
    break
  dp = [1,2,4]
  for i in range(3,n):
    dp.append(dp[i-3]+dp[i-2]+dp[i-1])
  day = (dp[n-1]-1)//10+1
  year = (day-1)//365+1
  print(year)

Python: import math
while True:
    n=int(input())
    if n==0:
        break
    elif n>=4:
        dp=[0]*n
        dp[0]=1
        dp[1]=2
        dp[2]=4
        for i in range(3,n):
            dp[i]=dp[i-1]+dp[i-2]+dp[i-3]
        print(int(math.ceil(dp[n-1]/10/365)))
    else:
        print(1)

Python: import functools

@functools.lru_cache(maxsize = 30)
def f(n) :
      if(n == 1) :
        return 1
      elif(n == 2) :
        return 2
      elif(n == 3) :
        return 4
      else :
        return f(n - 1) + f(n - 2) + f(n - 3)
      
while True :
  n = int(input())
  if(n == 0) :
    break
  else :
    if(f(n) % 10 == 0) :
      x = f(n) // 10
    else :
      x = f(n) // 10 + 1
    
    if(x % 365 == 0) :
      s = x // 365
    else :
      s = x // 365 + 1
     
    print(s)

Python: import functools
@functools.lru_cache(maxsize=30)
def f(n):
  if n==1:
    return 1
  elif n==2:
    return 2
  elif n==3:
    return 4
  else:
    return f(n-1)+f(n-2)+f(n-3)
while True:
  n=int(input())
  if n==0:
    break
  if n<=10:
    print("1")
  else:
    if f(n)%10==0:
      if (f(n)//10)%365==0:
        print((f(n)//10)//365)
      else:
        print(((f(n)//10)//365)+1)
    else:
      if ((f(n)+1)//10)%365==0:
        print(((f(n)+1)//10)//365)
      else:
        print((((f(n)+1)//10)//365)+1)

Python: #演習2－5　
while True:
    n=int(input())
    if n==0:
        break
    else:
        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]
    print((A[n]//3650)+1)

Python: import functools, math


@functools.lru_cache(maxsize=None)
def rec(i):
    if i <= 0:
        return i == 0
    return rec(i-1) + rec(i-2) + rec(i-3)

while True:
    N = int(input())
    if not N:
        break
    print(int(math.ceil(rec(N)/3650)))

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+48)
        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: dp = [0]*31
dp[0] = 1
dp[1] = 1
dp[2] = 2
dp[3] = 4
for i in range(4,31):
    dp[i] = dp[i-1]+dp[i-2]+dp[i-3]
while True:
    n = int(input())
    if n == 0:
        exit()
    else:
        if dp[n]%3650 == 0:
            print(dp[n]//3650)
        else:
            print(dp[n]//3650+1)

Python: dp = [None] * 31
dp[0] = 1
dp[1] = 1
dp[2] = 2
def func(n):
  for i in range(3, n + 1):
    dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1]

func(30)

while True:
  n = int(input())
  if n == 0:
    break
  p = dp[n]
  p = p // 10 + bool(p % 10)
  print(p // 365 + bool(p % 365))