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 <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#define rep(i,n) for (int i = 0; i < (n); ++i)

using namespace std;
const int MOD = 1000000007;

typedef long long int ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;

int solve(vector<int> &dp,int n) {
    if(n==0)return 1;
    if(dp[n]!=0)return dp[n];
    dp[n] =  solve(dp,n-3) +solve(dp,n-2) + solve(dp,n-1);
    return dp[n]; 
}

int main() {
    vector<int> dp(31,0);
    int n;
    cin >> n;
    dp[1]=1;dp[2]=2;dp[3]=4;

    while(n){
        cout << ((solve(dp,n)/10)/365)+1  << endl;
        cin >> n;
    }
    return 0;
}

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

int main(){
	int n,A[40];
	queue<int> Q;
	A[0]=1;
	cin>>n;
	while(n !=0){
		for(int i=1;i<n+1;++i){
			A[i]=A[i-1];
			if(i>1){
				A[i]+=A[i-2];
			}
			if(i>2){
				A[i]+=A[i-3];
			}
		}
		A[n]=1+(A[n]/3651);
		Q.push(A[n]);
		cin>>n;
	}
	while(Q.empty()==0){
		cout<<Q.front()<<endl;
		Q.pop();
	}
}

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

int main() {
    int dp[40];
    for (int i = 0; i < 40; i++) dp[i] = 0;
    dp[0] = 1;

    for (int i = 0; i < 30; i++) {
        dp[i + 1] += dp[i];
        dp[i + 2] += dp[i];
        dp[i + 3] += dp[i];
    }
    
    int n;
    while (cin >> n) {
        if (n == 0) break;
        int cnt = dp[n];
        cout << (cnt + 10 * 365 - 1) / (10 * 365) << endl;
    }
    return 0;
}

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

int num(int n);

int main(){
  int n;
  cin>>n;
  cout << num(n)//3650+1 <<endl;
}

int num(int n){
  if(n<1)return 0;
  return num(n-1)+num(n-2)+num(n-3);
}

C++: #include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    int ans;
    while(1){
        cin >> n;
        if(n == 0)break;
        if(n <= 2){
            cout << 1 << endl;
            continue;
        }
        vector<int> ways(n+1);
        ways[1] = 1;
        ways[2] = 2;
        ways[3] = 4;
        for(int i = 4; i <= n; i++){
            ways[i] = ways[i-1] + ways[i-2] + ways[i-3];
        }
        if(ways[n] % 3650 == 0){
            ans = ways[n] / 3650;
        }else{
            ans = (ways[n] / 3650) + 1;
        }
        cout << ans << endl;
    }
    return 0;
}

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

int fact(int n){
    int res=0;
    if (n==0) {
        return 1;
    }
    if (n>=3) {
        res+=fact(n-3);
    }
    if (n>=2) {
        res+=fact(n-2);
    }
    if (n>=1) {
        res+=fact(n-1);
    }
    return res;
}

int main(){
    int i;
    while (cin>>i,i) {
        int a=0;
        a+=fact(i);
        int day=a/10;
        cout<<day/365+1<<endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

int main(void){
	int n;
	//d[0] = 1patern d[1] = 1paten d[2] = 2patern
	int dp[41] = {1, 1, 2};
	for(int i = 3; i <= 31; i++){
		dp[i] = dp[i-3] + dp[i-2] + dp[i-1];
	}
	while(cin >> n, n)
		FIN(dp[n]/3650 + 1);

	return 0;
}

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