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 <vector>
#include<queue>
using namespace std;
#define loop(i,n) for (int i = 0; i < n; i++)
int main()
{
	int n;
	while (cin >> n&&n)
	{
		vector<long long int> dp(n + 1, 0);
		dp[0] = 1;
		loop(i, n)
		{
			dp[i + 1] += dp[i];
			if (i + 2 <= n)dp[i + 2] += dp[i];
			if (i + 3 <= n)dp[i + 3] += dp[i];
		}
		cout << dp[n] / 3650 + 1 << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
    while(1)
    {
        int dp[31]={1,1,2,4};
        int n;
        cin>>n;
        for(int i=4;i<=n;++i){
            dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
        }
        cout<<((dp[n]-1)/3650)+1<<endl;
    }
}

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

using namespace std;

int main(){
  int n;
  while(cin >> n && n!=0){
    vector<int> v(n+1,0);
    v[0]=1;
    for(int i=0;i<n;i++){
      v[i+1]+=v[i];
      if(i<n-1){v[i+2]+=v[i];}
      if(i<n-2){v[i+3]+=v[i];}
    }
    //int型の除算は切り捨て
    //http://bttb.s1.valueserver.jp/wordpress/blog/2017/07/23/競プロのテクニック-割り算の切り上げ、四捨五入/
    //参考にした

    cout << (((v[n]+9)/10)+364)/365 << endl;
  }
}

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

int A[128], n, a; 
int main() {
	while(cin >> n && n >0){
		A[0] = 0;
		A[1] = 1;
		A[2] = 2;
		for (int i=3; i<=n+10; ++i) {
			A[i] = A[i-1]+A[i-2]+A[i-3];
		}
		a = (int)((A[n]+9)/10);
		a = (int)((a+364)/365);
	cout << a <<endl;
	}
}

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

#define rep(i,j) for(int (i)=0;(i)<(int)(j);++(i))

int a[300], n;

int main() {
    a[0] = 1;
    for (int i = 0; i <= 32; ++i) {
        if (i == 0) a[i] = 1;
        else if (i == 1) a[i] = a[i-1];
        else if (i == 2) a[i] = a[i-1]+a[i-2];
        else  a[i] = a[i-1]+a[i-2]+a[i-3];
    }

    while (cin >> n, n) {
        cout << (int)(((a[n]/10.0)/365.0)+0.5)+1 << endl;
    }
}

C++: #include <stdio.h>



long memo[31];

long fanc(int flo)
{
	int i;
	long sum=0;
	if(flo<0){return 0;}
	if(memo[flo]!=0){return memo[flo];}

	for(i=1;i<=3;i++)
	{
		sum+=fanc(flo-i);
	}
	
	return memo[flo]=sum;
}
int main()
{
	long int num;
	int n;
	int i;
	int ans;
	
	for(i=0;i<31;i++)
	{
		memo[i]=0;
	}
	memo[0]=1;
	while(scanf("%d",&n)&&n!=0)
	{
		num=fanc(n);
		ans=num/3650 + !!(num % 3650);
		
		printf("%d\n",ans);
	}
}

C++: #include <stdio.h>
#include <math.h>

#define N 30

int main(void) {
  int n = 0;
  int dp[N + 1] = {0};

  scanf("%d", &n);

  dp[0] = 1;

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

    int years = (int) ceil((dp[n] / 10.0) / 365.0);

    printf("%d\n", years);

    scanf("%d", &n);    
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int dp[35];

int rec(int n) {
    if (0 <= dp[n]) return dp[n];
    if (n == 0) return 1;
    int s1 = 0 <= (n - 1) ? rec(n - 1) : 0;
    int s2 = 0 <= (n - 2) ? rec(n - 2) : 0;
    int s3 = 0 <= (n - 3) ? rec(n - 3) : 0;
    dp[n] = s1 + s2 + s3;
    return dp[n];
}

void solve(int n) {
    for (int i = 0; i < 35; ++i) dp[i] = -1;
    int x = rec(n);
    int y = x / 3650;
    int m = x % 3650;
    cout << (y == 0 ? 1 : y + 1) << endl;
}

int main() {
    while(true) {
        int n;
        cin >> n;
        if (n == 0) break;
        solve(n);
    }
    return 0;
}