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;

long long ways[31];

long long howManyWays(int n) {
    if (ways[n]) {
        return ways[n];
    }
    if (n <= 0) {
        return ways[0] = 1;
    } else if (n == 1) {
        return ways[1] = howManyWays(0);
    } else if (n == 2) {
        return ways[2] = howManyWays(1) + howManyWays(0);
    } else {
        return ways[n] = howManyWays(n - 1) + howManyWays(n - 2) + howManyWays(n - 3);
    }
}

int main() {
    while (true) {
        int n;
        cin >> n;
        if (n == 0) {
            break;
        }
        long long way = howManyWays(n);
        cout << way / 3650 + 1 << endl;
    }
}

C++: #include<cstdio>
#include<iostream>

using namespace std;

int main(){
	int dp[33]={0};
	
	dp[0]=1;
	for(int i=0;i<33;i++){
		if(i-1>=0)dp[i]+=dp[i-1];
		if(i-2>=0)dp[i]+=dp[i-2];
		if(i-3>=0)dp[i]+=dp[i-3];
	}
	
	while(1){
		int n;
		cin>>n;
		if(n==0)break;
		
		printf("%d\n",(dp[n]+3649)/3650);
	}
}

C++: #include<iostream>

using namespace std;

int main(){

	int n;

	while(n>0){

		cin >> n;

		int set = n / 3;
		int r = n % 3;
		int total = 0;

		while(set > 0){
			if(set == n / 3){total += 4;}
			else{
				total = total * 4 * 2 - 8;
			}
			set--;
		}

		if(n < 3){
			total += r;
		}
		else{
			if(r == 1){
				total = total * 2 - 1;
			}
			else if(r == 2){
				total = total * 4 - 3;
			}
		}

		int ans = total / 3650;

		if(total % 3560 != 0){
			ans++;
		}

		cout << ans << endl;

	}

	return 0;
}

C++: #include <iostream>

using namespace std;
int N;
int A_count(int x){
	if (x == 0){
		return 1;
	}else if (x == 1){
		return 1;
	}else if (x == 2){
		return 2;
	}else{
		return (A_count(x-1) + A_count(x-2) + A_count(x-3));
	}
}

int main() {
	while (cin >> N && N){
		cout << (((A_count(N)+9)/10)+364)/365 << endl;		
	}
	return 0;
}

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

int main(){
	int n;
	int m[30] = {1, 1, 2};

		for(int i= 3; i < 30; i++){
			m[i] = m[i-1] + m[i-2] + m[i-3];
		}
	while(cin >> n, n){
		cout << m[n] / (365 * 10) + 1 << endl;
	}
}

C++: #include<iostream>
#include<string>
using namespace std;
long long dp[30];
int main(){
	int n;
	while(true){
	cin>>n;
	if(n==0)
		break;
	for(int i=0;i<n;i++)
		dp[i]=0;
	dp[0]=1;
	dp[1]=2;
	dp[2]=4;
	for(int i=3;i<n;i++){
		dp[i]+=dp[i-3]+dp[i-2]+dp[i-1];
	}
	cout<<(dp[n-1]/3650)+1<<endl;
	}
    return 0;
}

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

using namespace std;

int main()
{
    int dp[31] = {1, 1, 2};
    int n;

    for (int i = 3; i <= 30; i++)
        dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];

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

    return 0;
}

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

int stair[31];
int n;

void solve(){
	for(int i=2; i<=30; i++)
		stair[i] = 0;
	stair[1] = 1;
	stair[2] = 1;
	stair[3] = 1;
	for(int i=1; i<=27; i++){
		stair[i+1] += stair[i];
		stair[i+2] += stair[i];
		stair[i+3] += stair[i];
	}
	stair[29] += stair[28];
	stair[30] += stair[28];
	stair[30] += stair[29];
}

int main(){
	solve();
	int ans;
	while(true){
		cin >> n;
		if(!n)
			return 0;
		ans = stair[n]/10;
		if(stair[n]%10)
			ans++;
		if(ans%365)
			ans += 365;
		ans /= 365;
		cout << ans << endl;
	}
}

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

int memo[300];
int dp(int num);

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

		memset(memo, -1, sizeof(memo));

		cout << (int)ceil(dp(n) / 3650.0) << endl;
		//cout << dp(n) << endl;
		
	}

	return 0;
}

int dp(int num){
	memo[0] = memo[1] = 1;
	memo[2] = 2;

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

	return memo[num];
}

C++: #include<iostream>

using namespace std;

int main(){

	int n;

	int memo[100];

	while(1){

		cin>>n;

		if(n==0) break;

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