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 <bits/stdc++.h>

typedef long long ll;
using namespace std;

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

	while(1){
		int n; cin >> n;
		if(n == 0) break;
		vector<ll> dp(31,-1);
		dp[0] = 1;
		dp[1] = 1;
		dp[2] = 2;
		dp[3] = 4;
		for (int i = 4;i <= n;i++){
			dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
		}	
	
		ll day = (dp[n]-1)/10 + 1;
		cout << ((day - 1)/365 + 1) << endl;
	}

	return 0;

}

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

int main() {
    while (true) {
        int n;
        cin >> n;
        if (n == 0) break;
        vector<long long> dp(n + 1, 0);
        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 ans = ceil(dp[n] / 3650.0);

        cout << ans << endl;
    }

    return 0;
}

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


void solve(vector<int>& a) {
    a[0] = 1;
    for(int i = 1; i <= 30; i++) {
        if(i == 1) {
            a[i] = a[i - 1];
        } if(i == 2) {
            a[i] = a[i - 1] + a[i - 2];
        } else {
            a[i] = a[i - 1] + a[i - 2] + a[i - 3];
        }
    }
    for(int i = 1; i <= 30; i++) {
        a[i] = (a[i] + (3650 - 1)) / 3650;
    }
}

int main() {
    vector<int> a(31);
    solve(a);
    vector<int> inpArray;
    int inp;
    do {
        cin >> inp;
        inpArray.push_back(inp);
    } while(inp != 0);

    for(int i = 0; i < (int)inpArray.size() - 1; i++)
        cout << a[inpArray[i]] << endl;

    return 0;
}

C++: #include <algorithm>
#include <iostream>
using namespace std;
int N;
int main() {
  while (cin >> N && N>0) { //??????????????????????????????
    int A[N];
    A[0] = 1;
    for (int i=1; i<=N; ++i) { //A[n]????¨????
      A[i] = A[i-1];
      if (i>1) A[i] += A[i-2];
      if (i>2) A[i] += A[i-3];
    }
    cout << ((A[N]+9)/10+364)/365 << endl; //int??§????????¨???????????????????????????????¶??????¨???
  }
}

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

using namespace std;

long long tri(int n)
{
	if(n <= 2)
	{
		return 1;
	}
	else if(n == 3)
	{
		return 2;
	}
	else
	{
		auto table = vector<int>(n+1,0);
		table[0] = 1;
		table[1] = 1;
		table[2] = 2;
		for(int i = 3;i <= n;i++)
		{
			table[i] = table[i-1] + table[i-2] + table[i-3];
		}
		return table[n];
	}
}

int main()
{
	int n;
	cin >> n;
	while(n)
	{
		int s = tri(n);
		int day = (s+9)/10;
		int year = (day+364)/365;
		cout << year << endl;
		cin >> n;
	}
	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>

int compare_int(const void* a, const void* b) { return *(int*) a - *(int*) b; }

//int n, dp[31];
//
//int func(int p) {
//	if (p == n) {
//		return 1;
//	}
//	int cnt = 0;
//	for (int i = p + 1; n >= i && 3 + p >= i; i++) {
//		if (dp[i] == -1) dp[i] = func(i);
//		cnt += dp[i];
//	}
//	return cnt;
//}
//
//int main() {
//	while (scanf("%d", &n) != EOF) {
//		if (n == 0) return 0;
//		memset(dp, -1, sizeof(dp));
//		printf("%d\n", ((func(0)+9) / 10 + 364) / 365);
//	}
//}

int main() {
	int n, b[2], dp[33] = {};
	scanf("%d", &n);
	dp[n] = 1; dp[n - 1] = 1;
	for (int i = n-2; 0 <= i; i--) {
		dp[i] = dp[i + 1] + dp[i + 2] + dp[i+3];
	}
	printf("%d\n", ((dp[0]+9)/10+364)/365);
	return 0;
}

/*

dp[i] = {dp[i+1]+dp[i+2]+dp[i+3] ????????????

*/