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>
using namespace std;

int main(){
	int n;
	double ans =0;
	int checkc = 0;
	int i = 4;
	double check[3] = { 1, 2, 4 };

	cin >> n;

	switch (n){
	case 1:
		ans = 1;
		break;
	case 2:
		ans = 2;
		break;
	case 3:
		ans = 4;
		break;
	default :
		while (n >= i){
			ans = check[0] + check[1] + check[2];
			i++;
			check[0] = check[1];
			check[1] = check[2];
			check[2] = ans;
		}
	}

	ans = ans / 3650;
	checkc = (int)(ans);

	if (ans > (double)(checkc)){
		checkc++;
	}
	if (ans != 0){
		cout << checkc << endl;
	}
	else{
		cout << endl;
	}

	return 0;
}

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

int f(int n){   //再帰関数
    if( n==1 )return 1;
    if( n==2 )return 2;
    if( n==3 )return 4;
    //f(n)=f(n-1)+f(n-2)+f(n-3)
    return f(n-1)+f(n-2)+f(n-3);
}
int main(void){
    int n;
    while(true){
    cin >> n;
    if(n==0)break;
    cout << (f(n)/3650)+1 << endl;
    }
}

C++: #include <iostream>
using namespace std;
int main()
{
    int N;
    long long A[31];
    while((cin >> N)&&(N > 0))
    {
        for(int i = 0; i <= N; i++)
        {
            if(i == 0)
            {
                A[i] = 1;
            }
            else if(i == 1)
            {
                A[i] = A[i-1];
            }
            else if(i == 2)
            {
                A[i] = A[i-1] + A[i-2];
            }
            else
            {
                A[i] = A[i-1] + A[i-2] + A[i-3];
            }
        }

        cout << (((A[N] + 9) / 10) + 364) / 365 << endl;

    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int MAX_N = 30;

int main() {
    while (true) {
        // input
        int n; cin >> n;
        
        if (n == 0) break;

        // initialize DP table
        int dp[MAX_N + 1];
        for (int i = 0; i <= n; i++) dp[i] = 0;

        // initial condition
        dp[0] = 1;

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

        int year = (dp[n] + 3649) / 3650;
        cout << year << endl;
    }
    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)
#define INF (1<<20)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

int a[40], n;

int main()
{
	while (cin >> n, n) {
		a[0] = 1;
		for (int i = 1; i <= 32; i++) {
			a[i] = a[i - 1];
			if (i - 2 >= 0)a[i] += a[i - 2];
			if (i - 3 >= 0)a[i] += a[i - 3];
		}
		cout << ceil(a[n] / 10.0 / 365.0) << endl;
	}
	return	0;
}

C++: #include <cstdio>

using namespace std;

int n,dp[34];

int main(){
  while(1){
    scanf("%d",&n);
    if(n==0) break;
    for(int i=0;i<34;i++) dp[i]=0;
    dp[0]=1;

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

    //for(int i=0;i<n;i++) printf("%d_%d\n",i,dp[i]);

    int ans=(dp[n]/3650)+1;

    printf("%d\n",ans);

  }
  return 0;

}

C++: #include <iostream>
using namespace std;
int trib(int a){
    if(a==1){return 1;}
    if(a==2){return 2;}
    if(a==0){return 1;}
//  if(a==3){return }
    return trib(a-3)+trib(a-2)+trib(a-1);
}
int main() {
    // your code goes here
int a;
while(true){
    cin>>a;
    if(a==0){return 0;}
cout<<((trib(a)+1)/10+1)/365+1<<endl;
     
}
    return 0;
}