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<algorithm>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
using namespace std;
#define rep(i, j) for(int i = 0; i < j; i++)
#define f(i, k, j) for(int i = k; i < j; i++)
#define P pair<int, int>
const int INF = (1 << 26);
const int MAX_N = 31;
long long int dp[MAX_N];

void solve(){
    memset(dp, 0, sizeof(dp));
    dp[1] = 1; dp[2] = 2; dp[3] = 4;
    for(int i = 4; i < MAX_N; i++){
        dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
    }
}

int main(){
    solve();
    int n;
    while(cin >>n && n != 0){
        int ans = dp[n] / 3650;
        if(dp[n] % 3650 != 0) ans++;
        cout <<ans <<endl;
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int Kannondou(int n){
	int dp[4] = {1,2,4,0};

	if(n<=3)
		return dp[n-1];

	for(int i = 3; i < n; ++i){
		dp[ 3 ] = dp[ 2 ] + dp[ 1 ] + dp[ 0 ];
		dp[ 0 ] = dp[ 1 ];
		dp[ 1 ] = dp[ 2 ];
		dp[ 2 ] = dp[ 3 ];
	}
	return dp[ 3 ] / 3650 + 1;
}
int main(){
	while(true){
		int n;

		cin>>n;
		if(n == 0)
			break;

		cout << Kannondou( n ) << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()

const int MAXN = 32;

long long d[MAXN], day, year;

int main()
{
    d[0] = 1;
    d[1] = 1;
    d[2] = 2;
    REP(MAXN-3) d[i+3] = d[i]+d[i+1]+d[i+2];
    
    int n;
    while(cin >> n && n)
    {
        day = d[n] / 10;
        if(d[n] % 10  > 0 ) day++;
        year = day/365;
        if(day % 365 > 0) year++;

        cout << year << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;

ll dp[31];
ll memo[31];

ll rec(ll n){
    if(n < 0) return 0;
    if(n < 2) return 1;
    if(memo[n]) return memo[n];
    
    return memo[n] = rec(n - 1) + rec(n - 2) + rec(n - 3);

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    while(true){
        ll n;
        cin >> n;
        
        if(n == 0) return 0;
        
        rep(i,31){
            memo[i] = 0;
        }
        
        cout << rec(n)/3650 + 1<< endl;
    }
}

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

int s[30];
int n;

int main() {
  
  while(1) {
    cin >> n;
    if(!n)break;
    
    s[0] = 1;
    s[1] = 2;
    s[2] = 4;
    
    for(int i=3;i<n;i++) {
      s[i] = s[i-1]+s[i-2]+s[i-3];
    }
    int r = s[n-1]/10;
    r += s[n-1]%10?1:0;
    r = (r-1)/365 + 1;
    cout << r << endl;
    
  }
  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
#define INF 999999999
using namespace std;
int main() {
  int a, kai[31];
  kai[0] = 1;
  kai[1] = 1;
  kai[2] = 2;
  for (int i = 3; i < 31; i++) {
    kai[i] = kai[i - 1] + kai[i - 2] + kai[i - 3];
  }
  rep(i, 31) kai[i] = (kai[i] + 3649) / 3650;
  while (cin >> a, a)
    cout << kai[a] << endl;
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> p;
#define le 1000000007;
int main(void){
  while(1==1){
  int n;
  cin >> n;
  if(n==0)return 0;
  int k[128];
  int memo[128];
  vector<int> fla(128,0);
  k[0]=0;
  k[1]=1;
  k[2]=2;
  k[3]=4;
  if(n==1 || n==2 || n==3){
    cout << 1 << endl;return 0;
  }
  if(fla[n]==8){
    cout << memo[n]/3650+1 << endl;
    return 0;
  }
  for(int i=4;i<=n;i++){
    k[i]=k[i-1]+k[i-2]+k[i-3];
    memo[i]=k[i];
    fla[i]=8;
  }
  cout << k[n]/3650+1 << endl;
}
  return 0;
}

C++: #include <cstdio>

#define MAX 31

int main(){
  int dp[MAX] = {1,1,2};

  for(int i = 3 ; i < MAX ; i++){
    dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
  }

  int n;
  while(scanf("%d" ,&n),n){
    printf("%d\n" ,dp[n]/3650+1);
  }

  return 0;
}