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>

struct Memo
{

	int count;
	bool flag;

	Memo()
	{

		count = 0;
		flag = false;

	}

};

using namespace std;

Memo memo[31][4];

int ProgressNumberOfYears(int step_num,int step_length)
{

	int kind_count = 0;

	if(memo[step_num][step_length].flag && step_length != 0) return memo[step_num][step_length].count;
	else if(step_num == 0) return 1;
	else if(step_num < 0) return 0;

	for(int i = 1; i < 4; ++i)	kind_count += ProgressNumberOfYears(step_num - i,i);

	Memo temp;

	temp.count = kind_count;
	temp.flag = true;

	memo[step_num][step_length] = temp;

	return kind_count;

}

int main()
{

	int step_num;

	while(cin >> step_num && step_num != 0) cout << ProgressNumberOfYears(step_num,0) / 10 / 365 + 1 << endl;

	return 0;

}

C++: #include <iostream>

using namespace std;
int n;
int a[35];

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

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

int main() {
  int dan;
  while (cin >> dan && dan>0) {
    int array[dan];
    for (int i=0;i<=dan;++i) {
      if (i==0)
	array[i] = 1;
      else if (i==1)
	array[i] = array[i-1];
      else if (i==2)
	array[i] = array[i-1]+array[i-2];
      else
	array[i] = array[i-1]+array[i-2]+array[i-3];
    }
    cout << (((array[dan]+9)/10)+364)/365 << endl;
  }
}

C++: #include <iostream>
using namespace std;
int main(void){
    int n;
    int dp[31];
    dp[0] = 1;
    dp[1] = 1;
    dp[2] = 2;
    for(int i = 3; i < 31; i++){
        dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
    }
    while(1){
        cin >> n;
        if(n == 0)  break;
        int x;
        x = dp[n] / 3650;
        if(dp[n]%3650 != 0) x++;
        cout << x << endl;
    }
    return 0;
}

C++: #define REP(i,n) for (int i=0;i<(n);i++)
#include <iostream>
#include <cmath>
using namespace std;

int main(){
        int n=0;
        while(cin>>n&&n>0){
                double a[n+1];
                REP(i,n+1){
                        switch(i){
                        case 0:
                                a[i] = 1;
                                break;
                        case 1:
                                a[i] = a[i-1];
                                break;
                        case 2:
                                a[i] = a[i-1] + a[i-2];
                                break;
                        default:
                                a[i] = a[i-1] + a[i-2] + a[i-3];
                                break;
                        }
                }
                cout << ceil(a[n] / 10 / 365) << endl;
        }
}

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

#define INF 999999999

int gcd(int x, int y) {
	if (x % y == 0)return y;
	else return gcd(y, x%y);
}

int lcm(int x, int y) {
	return x*y / gcd(x, y);
}

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

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

int main(void){
	const int ofDay = 10;
	const int MAXN = 30;
	const int TOBIN = 3;
	const int YEAR = 365;
	int dp[MAXN+1];
	int tobi[TOBIN] = {1,2,3};
	
	// init
	for(int i=0; i<=MAXN; i++)
		dp[i] = 0;
	dp[1] = 1;
	dp[2] = 1;
	dp[3] = 1;

	// 全通り計算
	for(int i=1; i<=MAXN-3; i++){
		for(int j=1; j<=TOBIN; j++){
			dp[i+j] += dp[i];
		}
	}

	// 年数
	for(int i=1; i<=MAXN; i++){
		dp[i] = dp[i] / ofDay / YEAR;
		dp[i] += 1;
	}

	// 対話
	while( true ){
		int n;
		cin >> n;
		if( n == 0 )
			break;

		cout << dp[n] << endl;
	}

	return 0;
}