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 <queue>
#include <map>
#include <array>

using namespace std;

int stairs[31];

void Solve(){
  stairs[0] = 1;

  for(int i=0; i<30; i++){
	for(int j=1; j<=3; j++){
	  if(i+j >= 31){
		break;
	  }
	  stairs[i+j] += stairs[i];
	}
  }
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  Solve();

  while(1){
	int n;
	cin >> n;
	
	if(n == 0){
	  return 0;
	}
	int years;
	years = (stairs[n]/3650);
	years += (stairs[n]%3650 != 0) ? 1 : 0;
	
	cout << years << endl;
  }
}

C++: #include<bits/stdc++.h>
using namespace std;

int c1(int A,int B){
int C=1;
for(int I=0;I<B;I++){C=C*A;}
return C;
}

int c2(int X,int Y){
int D=1;
for(int H=0;H<Y;H++){D=D*(X-H);}
for(int H=1;H<=Y;H++){D=D/H;}
return D;
}

int think(int G,int Z){
int E,F;
int AL=0;
E=Z/2;
F=Z%2;
for(int V=0;2*V<=Z;V++){
AL+=c1(G,(E-V)+(F+2*V))*c2((E-V)+(F+2*V),E-V);
return AL;
}}


int main(){
int n;
cin>>n;
int a=n/3;
int b=n%3;
int al=0;

for(int i=0;3*i<=n;i++){
int x=a-i;
int y=b+3*i;
al+=think(a+1,y);
}

cout<<al<<" "<<(al+3649)/3650<<endl;

return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int dp[50];

void print() {
   for (int i = 1; i < 33; i++) {
      cout << dp[i] << " ";
   }
   cout << endl;
}

void init() {
   dp[1] = 1, dp[2] = 2, dp[3] = 4;
   for (int i = 4; i < 33; i++) {
      dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
   }
}

int main() {
   init();
   while (1) {
      int n;
      cin >> n;
      if (n == 0) break;
      int day = dp[n] / 10;
      cout << day / 365 + (day % 365 != 0) << endl;
   }

   return 0;
}

C++: #include <iostream>
using namespace std;
int f(int n){
    if(n<0)
        return 0;
    if(n==0)
        return 1;
    if ( memo[n]!= -1 )
        return memo[n];
    return f(n-1)+f(n-2)+f(n-3);
}
 
int main(){
    int n;
    memo.resize(31,-1);
    while(1){
        cin >> n;
        if(n==0)
            break;
        int num=f(n);
        cout <<num/10/365+1<< endl;
    }
    return 0;  
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cctype>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <sstream>
#include <deque>

#define REP(i, n) for ( int i = 0; i < n; i++ )

using namespace std;

int main() {
    int n;
    
    vector<int> open(30);
    open[0] = 1;
    open[1] = 2;
    open[2] = 4;

    for ( int i = 3; i < 30; i++ ) {
        open[i] = open[i-1] + open[i-2] + open[i-3];
        // cout << i << ":" << open[i] << endl;
    }

    while(cin >>n, n) {
        n -= 1; // 添字に合わせる

        cout << (open[n]/10/365)+1 << endl;
    }
    
    return 0;
}

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

int main() {
    int n;
    long long dp[35];
    dp[0] = 1; //地面：１通り
    dp[1] = 1; //１段目：１通り
    dp[2] = 2; //２段目：２通り

    for (int i = 3; i <= 30; i++) {
        //一回に飛べるのが３段までなので
        dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
    }

    while (cin >> n && n) {
        long long ans = 0;
        ans = dp[n] / 3650;
        if (dp[n] % 3650) ans++;
        cout << ans << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
	ll int a[31] = {0};
	a[1] = 1; a[2] = 2; a[3] = 4;
	FOR(i,4,31){
		a[i] = a[i-1] + a[i-2] + a[i-3];
	}
	int n;
	while(cin >> n, n){
		cout << ((a[n]%3650==0) ? a[n]/3650 : a[n]/3650 + 1) << endl;
	}
}