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

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
    int n;
    int a[15000] = {0};
    while(scanf("%d",&n),n){
    int ans = 0;
    a[0] = 1;
    a[1] = 1;
    a[2] = 2;
    for(int i = 3;i <= n; i++){
        a[i] = a[i-1] + a[i-2] + a[i-3];
    }
    ans = a[n]/3650;
    printf("%d\n",ans+1);
    }
    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <sstream>
using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long

int n;

int a[30];

int main()
{
	a[0] = 1;
	a[1] = 1;
	a[2] = 2;
	FOR(i,3, 31)
	{
		a[i] = a[i - 3] + a[i - 2] + a[i - 1];
	}
	while (1)
	{
		cin >> n; if (n == 0) return 0;
		if (a[n] % 3650 == 0) cout << a[n] / 3650 << endl;
		else cout << (a[n] /3650) + 1 << endl;
	}
}

C++: #include <iostream>
using namespace std;

long long dp[30] = {1,1,2};
int ans[30];
int n;

int main(){
  
  for(int i = 3 ; i < 30 ; i++){
    dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
    ans[i] = dp[i] / 10;
    if(dp[i] % 10 != 0) ans[i]++;
    ans[i] = ans[i] / 365;
    if(dp[i] % 365 != 0) ans[i]++;
  }
  for(int i = 0; i < 30 ; i++){
    if(ans[i] == 0) ans[i] = 1;
  }

  while(cin >> n, n != 0){

    cout << ans[n] << endl; 
  }
  
  return 0;
}

C++: #include<cstdio>
#include<cstring>

int n;
int A[31];
/*DP????????????????????????*/
int solve(int k){
        if(A[k]>=0) return A[k];
        if(k==0) return A[k]=1;
        if(k==1) return A[k]=solve(k-1);
        if(k==2) return A[k]=solve(k-1)+solve(k-2);
        return A[k]=solve(k-1)+solve(k-2)+solve(k-3);
}

int main(){
        while(1){
                scanf("%d",&n);
                if(n==0) break;
                memset(A,-1,sizeof(A));
                printf("%d\n",solve(n)/10/365+1);
        }
        return 0;
}

C++: #include <iostream>
using namespace std;

int A[128], N;

int main() {

	while ( cin >> N && N ) {

		A[0] = 1;
	
		for ( int i = 1; i <= N; i++ ) {
	
			A[i] = A[i-1];
		
			if ( i >= 2 ) { A[i] += A[i-2]; }
			if ( i >= 3 ) { A[i] += A[i-3]; }
	
		}
		
		cout << ( ( A[N] + 9 ) / 10 + 364 ) / 365 << endl;

	}

}

C++: #include <cstdio>
using namespace std;
int main() {
    int dp[31];
    int n;
    dp[0]=1;
    dp[1]=1;
    dp[2]=2;
    for(int i=3;i<=30;i++){
        dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
    }
    while(true){
        scanf("%d",&n);
        if(n==0) break;
        int day=(dp[n]+9)/10;
        printf("%d\n",(day+364)/365);
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;

int main() {
	int n;
	vector<int> a(31);
	a[1] = 1;
	a[2] = 2;
	a[3] = 4;
	for (int i = 4; i < 31; ++i) a[i] = a[i - 3] + a[i - 2] + a[i - 1];
	while (cin >> n, n) cout << (364 + (9 + a[n]) / 10) / 365 << endl;
}

C++: #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
signed main() {
  int N;
  while (cin>>N, N!=0) {
    if (N < 3) {
      cout << 1 << endl;
      continue;
    }
    int dp[N];
    dp[0] = 1;
    dp[1] = dp[0]+1;
    dp[2] = dp[1]+dp[0]+1; 
    for (int i = 3; i < N; i++) {
      dp[i] = dp[i-3] + dp[i-2] + dp[i-1];
    }
    cout << ceil((dp[N-1]/10.0)/365.0) << endl;
  }  
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <queue>

using namespace std;

int main(){
    while(true){
        int n; cin >> n;
        if(!n) break;
        vector<long long> dp(n+1);
        dp[0]=1;
        for(int i=1; i<=n; ++i){
            if(i-3>=0) dp[i]+=dp[i-3];
            if(i-2>=0) dp[i]+=dp[i-2];
            if(i-1>=0) dp[i]+=dp[i-1];
        }
        long long tmp=(dp[n]+10-1)/10;
        cout << (tmp+365-1)/365 << endl;
    }
    return 0;
}