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;
/*
x?????????????????????????????????calc(x)
calc(0) = 1
calc(i) = calc(i - 1) * calc(i - 2) + calc(i - 3)
*/
int answer[30] = {};

int calc(int n) {
	for (int i = 0; i <= n; i++) {
		if (i == 0) answer[i] = 1;
		else if (i == 1) answer[i] = 1;
		else if (i == 2) answer[i] = 2;
		else answer[i] = answer[i - 1] + answer[i - 2] + answer[i - 3];
	}
	return (answer[n] / 3650) + ((answer[n] % 3650 > 0) ? 1 : 0);
}

int main() {
	int n;
	while (true) {
		cin >> n;
		if (n == 0) return 0;
		cout << calc(n) << endl; 
	}
}

C++: #include <iostream>

using namespace std;

int dp[32];
void DPCalc()
{
	dp[0] = 1;
	dp[1] = 1;
	dp[2] = 2;
	for(int i = 0; i < 28; ++i)
	{
		dp[i + 3] = dp[i] + dp[i + 1] + dp[i + 2];
	}
}

void solve()
{
	DPCalc();
	int n;
	while(cin >> n)
	{
		if(n == 0)
		{
			break;
		}
		int ans = dp[n] / 365 / 10;
		if(dp[n] % 365)
		{
			++ans;
		}
		cout << ans << endl;
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include<iostream>

using namespace std;

int main() {
    long long n[50], p;

	n[0] = 1; 
    n[1] = 1; 
    n[2] = 2;

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

	while (1) {
		cin >> p;
		if (p == 0){
            break; 
        }
        
		cout << (n[p] + 3649) / 3650 << endl;
	}
}

C++: #include<iostream>
#include<vector>
#include<cstdio>
#include<map>
#include<queue>

using namespace std;

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

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

int func(int n, int m){
	if(m==n)return 1;
	else if(m>n)return 0;
	else{
		int cnt=0;
		for(int i=1;i<=3;++i){
			cnt += func(n,m+i);
		}
		return cnt;
	}
}


int main(){
	int n;
	while(cin>>n,n){
		cout << func(n,0)/10/365+1 << endl;
		
		
	}
	
	
	
	
}

C++: #include <iostream>

using namespace std;

int dp[31];

int main()
{
  int n;

  while (1) {
    cin >> n;
    if (n == 0) break;
    for (int i = 0; i < sizeof(dp) / sizeof(int); i++) {
      dp[i] = 0;
    }

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

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

    int day = (dp[n] + 9) / 10;
    int year = (day + 364) / 365;

    cout << year << endl;
  }
}

C++: #include <iostream>
#include <string>
#include <algorithm>

#define dbg if(0)
using namespace std;
#define ll long long

int main(){
    int n;
    int stair[30+1];
    for(int i=0;i<=30;i++){
        stair[i]=0;
    }
    stair[0]=1;
    for(int i=0;i<=30;i++){
        if(i>0)stair[i]+=stair[i-1];
        if(i>1)stair[i]+=stair[i-2];
        if(i>2)stair[i]+=stair[i-3];
    }
    while(1){
        cin >> n;
        if (n==0)break;
        int ans=(stair[n]/10+364)/365;
        if (ans==0)ans++;
        cout <<ans<<endl;
    }

    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>

#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repn(i,n,m) for(int i=n;i<m;i++)
#define repn1(i,n,m) for(int i=n;i<=m;i++)
using namespace std;

int main(){

	int dp[100] = {0};
	int n,m;
	
	dp[1] = 1;
	dp[2] = 2;
	dp[3] = 4;

	repn(i, 4, 35) dp[i] = dp[i-1] + dp[i-2] + dp[i-3];

	while(cin >> n, n){
		cout << dp[n] / 10 / 360 + 1 << endl;
	}

	return 0;
}

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


int main(){
	int dp[31]={0};
	dp[0]=dp[1]=1;
	dp[2]=2;
	for(int i=3;i<=30;i++){
		dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
	}
	int n;
	while(cin>>n&&n){
		cout<<(dp[n]+3649)/3650<<endl;
	}
	return 0;
}