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 = []
a[:4] = [0, 1, 2, 3]
inList = []
while True:
    price = int(input())
    if price == 0:
        break
    inList.append(int(input()))
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: import itertools,math,sys
def I(): return int(sys.stdin.readline().rstrip())
dp = [0]*31
dp[0],dp[1],dp[2] = 1,1,2
for i,j in itertools.product(range(3,31),[1,2,3]):
    dp[i] += dp[i-j]
while 1:
    n = I()
    if n==0:
        break
    print(math.ceil(dp[n]/10/365))

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) #地面が１なのでｎ段目までは要素がｎ+1
        A[0]=1
        A[1]=1
        A[2]=2
        for i in range(3,(n+1)): #1が3からnまで変化する
          A[i]=A[i-1]+A[i-2]+A[i-3]
        print((A[n])//3650+1)

Python: MAXN = 30
dp = [0] * (MAXN+1)
dp[1] = 1
dp[2] = 2
dp[3] = 4
for i in range(4,MAXN+1):
    dp[i] = dp[i-1] + dp[i-2] + dp[i-3]

while True:
    N = int(input())
    if N == 0: break
    print((dp[N]-1) // 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
        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: while True:
    n=int(input())
    if n==0:
        break
    else:
        A=[0]*31
        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: a = [1, 1, 2]
for i in range(3, 31):
    a.append(sum(a[-3:]))

while True:
    n = int(input())
    if not n:
        break
    print(((a[n] + 9) / 10 + 364) / 365)

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

    a=[1,1,2,4]
    for i in range(4,n+1):
        a.append(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 up(n):
	if n == 0: return 1
	if n < 0: return 0
	return up(n-1)+up(n-2)+up(n-3)
	
while True:
	n = int(raw_input())
	if n == 0: break
	print (up(n)//10+1)//365+1

Python: n = 30
dan_lis = [0] * n
dan_lis[0] = 1
dan_lis[1] = 2
dan_lis[2] = 4
for i in range(n - 3):
    dan_lis[i + 3] = dan_lis[i + 2] + dan_lis[i + 1] + dan_lis[i]
while True:
    n = int(input())
    if n == 0:
        break
    ans = dan_lis[n - 1]/10/365
    print(int(ans + 1))

Python: n = int(input())
st = [1,2,4]
for i in range(n-3):
    s = st[-1] + st[-2] + st[-3]
    st.append(s)
while (n != 0):
    pn = st[n-1]
    if (pn%10 == 0):
        pn //= 10
    else:
        pn = pn//10 + 1

    if (pn%365 == 0):
        pn //= 365
    else:
        pn = pn//365 + 1
    print(pn)
    n = int(input())
    st = [1,2,4]
    for i in range(n-3):
        s = st[-1] + st[-2] + st[-3]
        st.append(s)

Python: l = [ 0 for i in range(33)]
l[0] = 1
l[1] = 1

def f(n):
    if n == 2:
        if l[n] != 0:
            return l[2]
        else:
            l[2] = l[0] + l[1]
            return l[0] + l[1]
    elif n < 2:
        return l[n]
    else:
        if l[n] != 0:
            return l[n]
        else:
            l[n] = f(n-1) + f(n-2) + f(n-3)
            return l[n]
        
while True:
    n = int(input())
    if n == 0:
        exit()
    else:

        print(f(n)//3650+1)

Python: #!/usr/bin/python
import sys
if sys.version_info[0]>=3: raw_input=input
a=[1,1,2]
for i in range(3,31): a.append(a[i-1]+a[i-2]+a[i-3])
while True:
	n=int(raw_input())
	if n==0: break
	print((a[n]+3649)//3650)