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<stdio.h>

int n,i;
int dp[31];
int main(){
  dp[0]=1;
  dp[1]=1;
  dp[2]=2;
  dp[3]=4;
  for(i=4;i<=30;i++){
    dp[i]=dp[i-1]*2-dp[i-4];
  }
  
  while(1){
    scanf("%d",&n);
    if(n==0)break;
    printf("%d\n",(dp[n]+3649)/3650);
  }
  return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<memory.h>

using namespace std;
int main(){
	int dp[31][31];
	int n;
	while (1){
		cin >> n;
		if (n == 0)break;
		memset(dp, 0, sizeof(dp));
		dp[1][1] = 1;
		dp[1][2] = 1;
		dp[1][3] = 1;
		for (int i = 1; i <= 30; i++){
			for (int i2 = 1; i2 <= 30; i2++){
				if(i2+1<=30)dp[i + 1][i2 + 1] += dp[i][i2];
				if(i2+2<=30)dp[i + 1][i2 + 2] += dp[i][i2];
				if(i2+3<=30)dp[i + 1][i2 + 3] += dp[i][i2];
			}
		}
		int sum = 0;

		for (int i = 0; i < 30; i++){
			sum += dp[i][n];
		}
		cout << sum / 10 / 365 + 1 << endl;
	}
}

C++: #include<iostream>
#include<cstring>
using namespace std;
int dp[110];
int s;
bool flag;
long long int ans;
int solve(int i);
int main(){
  while(1){
    cin >> s;
    memset(dp, 0, sizeof(dp));
    flag = 0;
    if(s == 0) break;
    ans = solve(0);
    ans /= 10;
    if(!ans) flag = 1;
    if(ans % 365) flag = 1;
    ans /= 365;
    if(flag == 1) ans++;
    cout << ans << endl;
  }
}

int solve(int i){
  if(i == s) return 1;
  if(i > s) return 0;
  if(dp[i] > 0) return dp[i];
  return dp[i] = solve(i + 1) + solve(i + 2) + solve(i + 3);
}

C++: #include <bits/stdc++.h>
using namespace std;
const long long INF=1LL << 60;



int main() {
    vector<int> dan;
    vector<int> dp(35,0);
    int N;
    for(int i=0;i<35;i++){
        int tmp;
        cin>>tmp;
        if(tmp==0) break;
        dan.push_back(tmp);        
    }
    dp[0]=1;
    for(int i=1;i<31;i++){
        dp[i]+=dp[i-1];
        if(i>1)dp[i]+=dp[i-2];
        if(i>2)dp[i]+=dp[i-3];
    }
    for(int i:dan){
        cout << dp[i]/10/365+1<<endl;
    }

    return 0;
}

C++: #include <iostream>

using namespace std;
long A[31];
int main(){
  A[0] = 1;
  A[1] = 1;
  A[2] = 2;
  int n;
  while(cin>>n&&n>0){
    for(int i=3;i<=n;++i){
      A[i] = A[i-1]+A[i-2]+A[i-3];
    }
    cout<<A[n]/3650+1<<endl;
  }
  return 0;
}

C++: #include <algorithm>
#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 <bits/stdc++.h>

using namespace std;

int to_n(int n){
	if (n<=1){
		return 1;
	}else if (n==2){
		return 2;
	}
	return to_n(n-3)+to_n(n-2)+to_n(n-1);
}


int main(void)
{
	int in;
	
	while (cin >> in && in){
		cout << (to_n(in)+3649)/3650 << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#define fi first
#define se second
using namespace std;
bool value(int y,int x,int R,int C){return 0<=y&&y<R&&0<=x&&x<C;}
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
double pie=acos(-1);
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };
int main() {
	int n;
	int ans;
	int dp[35];
	dp[0]=0;
	dp[1]=0;
	dp[2]=1;
	while(cin>>n){
		if(n==0){
			break;
		}
		for(int i=3;i<n+3;i++){
			dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
		}
		if(dp[n+2]%3650==0){
			ans=dp[n+2]/3650;
		}
		else{
			ans=dp[n+2]/3650+1;
		}
		cout<<ans<<endl;
	}
}

C++: #include<stdio.h>
int main()
{
	const int N = 31;
	int n,i,j,s;
	while(scanf("%d",&n),n)
	{
		int a[N][N+3]={1};
		for(i=0;i<n;++i)
		{
			for(j = 0; j < n; ++j)
			{
				a[i+1][j+3] += a[i][j];
				a[i+1][j+2] += a[i][j];
				a[i+1][j+1] += a[i][j];
			}
		}
		for(s=i=0;i<n;++i)s+=a[i][n];
		printf("%d\n", (s/10-1)/365+1);
	}
	return 0;
}