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 <vector>
#include <set>
#include <map>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cstring>
#include <tuple>
#include <utility>
#include <unordered_set>

using namespace std;

typedef long long LL;
typedef vector<int> Array;
typedef pair<int, int> P;

const int INF = 1 << 29;
const LL MOD = 1000000009;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define ALL(c) (c).begin(), (c).end()

int main()
{
	int n;
	vector<int> dp(35);
	dp[0] = 1;
	REP(i, 30)REP(j, 3)dp[i + 1 + j] += dp[i];
	while (cin >> n && n)
	{
		cout << (dp[n] / 3650 + !!(dp[n] / 10 % 365)) << endl;
	}
	return 0;
}

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

using namespace std;

int cost;

void saiki(int n)
{
	
//	cout << n << endl;
	if(n <= 0){
		cost++;
		return;
	}
	if(n > 0){
		if(n-1 >= 0){
			saiki(n-1);
		}
		if(n-2 >= 0){
			saiki(n-2);
		}
		if(n-3 >= 0){
			saiki(n-3);
		}
	}
	/*
	else if(n == 0){
		cost++;
		return;
	}
	*/
}

int main()
{
	for(;;){
		int n, i;
		
		cin >> n;
		if(n == 0){
			break;
		}
		
		saiki(n);
		
		for(i = 1;; i++){
			cost -= 3650;
			if(cost <= 0){
				break;
			}
		}
		
		cout << i << endl;
	}
}

C++: #include<iostream>

using namespace std;

long long memo[100], ans;

int N;

int main() {
	while (true) {
                cin>>N;
                if(N==0){break;}
		memo[1] = 1;
		memo[2] = 2;
		memo[3] = 4;
		for (int i = 4; i <= N; i++) {
			memo[i] += memo[i - 1] + memo[i - 2] + memo[i - 3];
		}
		cout << memo[N] / (10 * 365) + 1 << endl;
	}
}

C++: #include <iostream>

using namespace std;

int main()
{
	const int comb[] = { 0, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274, 504, 927, 1705, 3136, 5768, 10609, 19513, 35890, 66012, 121415, 223317, 410744, 755476, 1389537, 2555757, 4700770, 8646064, 15902591, 29249425, 53798080 };

//	cut here before submit 
//	freopen ("testcase.kannondou", "r", stdin );
	int n;

	while (1){
		cin >> n;

		if (n == 0 ){
			break;
		} // end if
		int num = comb[n];

		if (num >= 10 ){
			num = (num / 10) + (num % 10 != 0 ? 1 : 0 );
		} // end if

		int res = num/365 + (num % 365 != 0 ? 1 : 0 );
		cout << res << endl;
	} // end loop

	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) 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;
int n,a=0;
void check(int x);
int main(void){
    for(;;){
        int z,b,c;
        a=0;
        cin>>n;
        if(n==0)break;
        check(0);
        if(a%10==0)b=a/10;
        else b=1+a/10;
        if(b%365==0)c=b/365;
        else c=1+b/365;

        cout<<c<<endl;
    }


	return 0;
}

void check(int x){

    if(x==n){
        a++;
        return;
    }

    if(x+3<=n)check(x+3);

    if(x+2<=n)check(x+2);

    if(x+1<=n)check(x+1);

}

C++: #include<iostream>
using namespace std;
int a,b,c,d,n,dp[31];
int main(){
  dp[1]=1;
  dp[2]=2;
  dp[3]=4;
  for(int i=4;i<=30;i++){
    dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
  }
  while(1){
    cin>>n;
    if(n==0)break;
    a=dp[n]/10;
    b=dp[n]%10;
    if(b>0)a++;
    c=a/365;
    d=a%365;
    if(d>0)c++;
    cout<<c<<endl;
     
  }
 
  return 0;
}