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>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

int main() {
  int n;
  while (cin >> n) {
    if (n == 0) {
      break;
    }
    vector<int> dp(n + 3);
    dp.at(n) = 1;
    for (int i = n - 1; i >= 0; i--) {
      dp.at(i) = dp.at(i + 1) + dp.at(i + 2) + dp.at(i + 3);
    }
    int total = dp.at(0);
    int day = 0;
    while (total > 0) {
      total -= 10;
      day++;
    }
    int year = (day + 365 - 1) / 365;
    cout << year << endl;
  }

  return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    while(1){
        int n;
        cin>>n;if(n==0)return 0;
        int sw[31];
        for(int i=0;i<=n;++i)sw[i]=0;
        sw[0]=1;
        for(int i=0;i<n;++i){
            if(i<n)sw[i+1]+=sw[i];
            if(i<n-1)sw[i+2]+=sw[i];
            if(i<n-2)sw[i+3]+=sw[i];
        }
        cout<<(sw[n]/3650)+1<<endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int64_t INF = 1000100;//1LL << 60;

int main() {
  int n;
  vector<int>dp(31);
  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){
    if(n>0){cout<<(dp[n]+3649)/3650<<endl;}
  }
  return 0;}

C++: #include<iostream>
using namespace std;
long long n[50], p;
int main() {
	n[0] = 1; n[1] = 1; n[2] = 2;
	for (int i = 3; i < 40; i++) {
		n[i] = n[i - 1] + n[i - 2] + n[i - 3];
	}
	while (true) {
		cin >> p;
		if (!p) { break; }
		cout << (n[p] + 3649) / 3650 << endl;
	}
}

C++: #include <iostream>

using namespace std;

int A[40];

int main(void) {
	int n;
	while(cin >> n && n) {
		for (int i = 0; i <= n; i++) {
			if (i == 0) A[i] = 1;
			else if (i == 1) A[i] = 1;
			else if (i == 2) A[i] = 2;
			else A[i] = A[i-3] + A[i-2] + A[i-1];
		}
		int ans;
		if (A[n] % 3650 == 0) ans = A[n] / 3650;
		else ans = A[n] / 3650 + 1;
		cout << "\n" << ans;
	}

	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    int dp[31]={};
    dp[0]=1;dp[1]=1;dp[2]=2;
    for(int i=3;i<31;i++){
        for(int j=1;j<4;j++){
            dp[i]+=dp[i-j];
        }
    }
    while(cin>>n,n){
        int num=dp[n]/3650;
        if(dp[n]%3650!=0)num++;
        cout<<num<<endl;
    }
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;

using ll = long long;

int main(void){
  vector<int> stairs;
  int input;
  do{
    cin >> input;
    if(input!=0) stairs.push_back(input);
  }while(input!=0);

  rep(i,stairs.size()){
    int max_step = stairs[i];
    vector<int> dp(max_step+1,-10);
    if(max_step<=4){
      cout << "1" << endl;
      continue;
    }
    
    dp.at(max_step) = 1;
    dp[max_step-1] = 1;
    dp[max_step-2] = 2;
    dp[max_step-3] = 4;
    for(int j=max_step-2;j>=0;j--){
      if(j+3<=max_step) dp.at(j) = dp.at(j+1)+dp.at(j+2)+dp.at(j+3);
    }
    ll day = dp[0]/10;
    ll ans;
    if(day%365==0) ans = day/365;
    else ans = day/365+1;
    cout << ans << endl;
  }
  
  return 0;
}

C++: #include<iostream>

long long int a[30];

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

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

int main(void)
{
	int n;
	while(cin >> n && n)
	{
		vector<int> dp(n + 5);
		dp[0] = 1;
		for (int i = 0; i < n; i++)
		{
			dp[i + 1] += dp[i];
			dp[i + 2] += dp[i];
			dp[i + 3] += dp[i];
		}
		cout << (dp[n] / 365 + !!(dp[n] % 365)) << endl;
	}
	return 0;
}