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<algorithm>
#include<vector>
#include<map>

using namespace std;

int main()
{

  int step_num;
  int dp[31];

  fill(dp,dp + 31,0);

  0[dp] = 1;

  for(int i = 1; i <= 30; ++i)
    {
      for(int j = 1; j <= 3; ++j)
        {

          if( i - j >= 0)   dp[i] = dp[i] + dp[i - j];

        }
    }

  while(cin >> step_num && step_num != 0) { cout << dp[step_num]/10/365 + 1<< endl; }

  return 0;

}

C++: #include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
	long long sum[31] = {0};
	
	sum[0] = 1;
	
	for(int i = 1; i < 31; ++i) {
		
		sum[i] = 0;
		if(i - 1 >= 0)
			sum[i] += sum[i - 1];
		if(i - 2 >= 0)
			sum[i] += sum[i - 2];
		if(i - 3 >= 0)
			sum[i] += sum[i - 3];
	}
	
	while(true) {
		
		int n;
		
		scanf("%d", &n);
		if(n == 0)
			break;
		
		printf("%lld\n", (sum[n] - 1LL) / 3650LL + 1LL);
	}
	
	return 0;
}

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

int main()
{
	int n;
	int year;
	while (cin >> n)
	{
		if (n == 0) break;

		int a[30];

		a[0] = 1;
		a[1] = 2;
		a[2] = 4;

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

		year = a[n - 1] / 3650;
		if (a[n - 1] % 3650 > 0)
		{
			year += 1;
		}

		cout << year << endl;

	}
	
	return 0;
}

C++: #include <iostream>

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

    int n=1;
    std::cin >> n;


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

    for (int i = 1; i < n; 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];
    }

    int year = 0;
    year = dp[n-1] / 3650;
    if ((dp[n-1] % 3650) > 0) year +=1;

    std::cout << year << std::endl;
    return 0;
}

C++: void main(){int n,i,ans[64]={0};ans[0]=ans[1]=1;ans[2]=2;for(i=3;i<31;i++)ans[i]=ans[i-1]+ans[i-2]+ans[i-3];for(;;){scanf("%d",&n);if(n==0)break;printf("%d\n",ans[n]/3650+1);}}

C++: /*
	AOJ_0173:Kannondou
*/

#include	<iostream>
#include	<utility>
#include	<algorithm>

using namespace std;

/*prototype declaration*/
long long getPattern(int x);

long long dp[30] = {1, 2, 4};

int main() {
	while(1) {
		int a;
		long long gp;
		
		cin >> a;
		if(a == 0) { break; }
		
		gp = getPattern(a);
		if(gp % 3650 != 0) {
			cout << gp / 3650 + 1 << endl;
		} else {
			cout << gp / 3650 << endl;
		}
	}
	return 0;
}

long long getPattern(int x) {
	if(x < 3) {
		return dp[x-1];
	} else {
		if(dp[x-1] != 0) {
			return dp[x-1];
		} else {
			dp[x-1] = getPattern(x-1) + getPattern(x-2) + getPattern(x-3);
			return dp[x-1];
		}
	}
}

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

#define rep(a, b, c) for (int a = b; a < c; a++)

using namespace std;

int main() {
    while (true) {
        int N;
        cin >> N;

        if (N == 0) break;

        N++;
        long long dp[N];
        dp[0] = 1;

        rep(i, 1, N) {
            dp[i] = dp[i - 1];
            if (i > 1) dp[i] += dp[i - 2];
            if (i > 2) dp[i] += dp[i - 3];
        }
        cout << ceil(ceil(dp[N - 1] / 10.0) / 365.0) << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int n;
  while(true){
    cin >> n;
    if(n == 0){
      break;
    }
    int table[n+4];
    fill(table, table+(n+4), 0);
    table[0] = 1;
    for(int i = 0; i < n; ++i){
      table[i+1] += table[i];
      table[i+2] += table[i];
      table[i+3] += table[i];
    }
    cout << (table[n] / 10 / 365) + 1<< endl;
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
long long dp[30];

void tribonacci(int n){
    if (n==1) {
        dp[n-1] = 1;
    } else if (n==2) {
        dp[n-1] = 2;
    } else if (n==3) {
        dp[n-1] = 4;
    } else {
        dp[n-1] = dp[n-2] + dp[n-3] + dp[n-4];
    }
}

int main() {
    int n;
    cin >> n;
    for(int i=1;i<=n;i++) {
        tribonacci(i);
    }
    cout << dp[n-1] << endl;
    return 0;
}