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>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef ll long long int
ll rr(int ll){
	if(y==0)
	return 1;
	else return y*rr(y-1);
}
ll func(ll i,ll j,ll k){
	return rr(i+j+k)/(rr(i)*rr(j)*rr(k));
}
int main(){
	ll n,sum,k;
	while(cin>>n,n){
		sum=0;
		for(ll i=0;i*3<=n;i++)
		for(ll j=0;j*2+3*i<=n;j++){
			k=n-(j*2+3*i);
			sum+=func(i,j,k);
		}
		if(sum%3650>0)
		cout<<sum/3650+1<<endl;
		else
		cout<<sum/3650<<endl;
	}
	return 0;
}

C++: // 0168_Kannondou.cpp
//
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 30;
int dp[MAX_N+1];
int solve(int n) {
  for(int i=0; i<=n; ++i) {
    if(i<=2) dp[i]=i;
    dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
  }
  return dp[n];
}
int main() {
  int n;
  while(cin >> n, n){
    fill(dp, dp+MAX_N+1, 0);
    int day = (solve(n) + 10-1)/10;
    int year = (day + 365-1)/365;
    cout << year << endl;
  }
  return 0;
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <cctype>

#include <iostream>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#include <algorithm>

using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
#define repi(i,l,n) for(int (i)=(int)(l);(i)<(int)(n);(i)++)
#define d_arr(arr, h, w) rep(i,(h) ){ cout << "["; rep(j,(w) ) { cout << (arr)[i][j] << ", "; } cout << "]" << endl;}
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x);

typedef pair<int ,int> P;

//n までの登り方の総数を返す
int solve(int n){
    if ( n <= 0) { return 1; }
    else if( n == 1 ){ return 1; }
    else if( n == 2 ){ return 2; }
    //else if( n == 3 ){ return 4; }
    return solve(n-1) + solve(n-2) + solve(n-3);
}

int main()
{
    while (true){
        int n;
        cin >> n;
        if ( n == 0) {break;}
        int sum = solve(n);
        int ret;
        if( sum % 3650  == 0){ ret = sum /3650; }
        else { ret = sum /3650 + 1; }
        cout << ret << endl;
    }
    return 0;
}

C++: #include <iostream>

int main(int argc, char const* argv[])
{
    int dp[35] = {0};



    dp[0] = 1;
    dp[1] = 1;
    dp[2] = 1;

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

    while (true) {
        int n;
        std::cin >> n;
        if (n == 0) break;

        int year = 0;
        year = dp[n-1] / 3650;
        if ((dp[n-1] % 3650) > 0) year +=1;
        std::cout << year << std::endl;
    }

    return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <cstdio>
using namespace std;
int x, c=0;
void dfs(int pos) {
	if (pos == 1) {
		c++;
		return;
	}else if (pos == 2) {
		c = c + 2;
		return;
	}
	else if (pos == 3) {
		c = c + 4;
		return;
	}
	else {
		dfs(pos - 1);
		dfs(pos - 2);
		dfs(pos - 3);
	}


}

int main() {
	while (1) {
	int	days = 0, years = 0;
	c = 0;
	cin >> x;
	if (x == 0) {
		break;
	}
	dfs(x);
	days = c / 10;
	if (c % 10 != 0) {
		days++;
	}
	years = days / 365;
	if (days % 365 != 0) {
		years++;
	}
	cout << years << endl;
	}
	

}

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

int main() {
	int n, a[31] = {0,1,2,4};
	while (1) {
		cin >> n;
		if (n == 0) break;

		for (int i = 4; i <= n; i++) {
			a[i] = a[i - 1] + a[i - 2] + a[i - 3];
		}
		cout << (a[n] / 10 + 1) / 365 + 1 << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
long dp[31];
main()
{
    dp[0]=1;
    for(int i=1;i<=30;i++)
    {
        for(int j=1;j<=3&&i-j>=0;j++)dp[i]+=dp[i-j];
    }
    int n;
    while(cin>>n,n)cout<<(dp[n]-1)/365+1<<endl;
}