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 (ll i = 0; i < n; i++)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define VSORT(v) sort(v.begin(), v.end());
#define VREV(v) reverse(v.begin(), v.end());
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
using vll = vector<ll>;
using vdouble = vector<double>;
using vstr = vector<string>;
typedef pair<int,int> P;
int dx[4] = {1, 0, -1, 0},dy[4] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
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 ll INF = 1LL << 60;
const ll mod = 1000000007;

int main(){
    ll n;
    while(cin >> n, n){
    if(n<=0) return 0;
	ll dp[n+1];
	dp[0]=1;
	dp[1]=1;
	dp[2]=2;
	if(n>=3)rep(i,n-2) dp[i+3]=dp[i+2]+dp[i+1]+dp[i];
	
	ll N=dp[n];
	N+=10;
	N/=10;
	N+=364;
	N/=365;
	cout<<N<<endl;
    }
}

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

typedef long long ll;

int dp[31];
ll f(int n){
    int & ans = dp[n];
    if(ans!=0) return ans;
    else {
        if(n==1) ans = 1;
        else if(n==2) ans = 1 + f(n-1);
        else if(n==3) ans = 1 + f(n-1) + f(n-2);
        else ans = f(n-1) + f(n-2) + f(n-3);

        return ans;
    }
}

int main(){
    memset(dp,0,sizeof(dp));
    int n;
    while(cin>>n,n){
        cout << f(n)/10/365 + 1 << endl;
    }
}

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

int main() {
    vector<int> dp(31, 0);
    dp[0] = 1;
    for (int i = 1; i <= 30; i++) {
        dp[i] = dp[i - 1];
        if (i >= 2) dp[i] += dp[i - 2];
        if (i >= 3) dp[i] += dp[i - 3];
    }
    int N;
    while (cin >> N, N) {
        cout << ((dp[N] + 10 - 1) / 10 + 365 - 1) / 365 << endl;
    }
    return 0;
}

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

using namespace std;

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

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

	while (cin >> n, n != 0){
		int cnt = 0;
		if (ary[n] % 3650 == 0){
			cout << ary[n] / 3650 << endl;
		}
		else cout << ary[n] / 3650 + 1 << endl;
	}

	return 0;
}

C++: #include <iostream>

using namespace std;

typedef long long ll;
ll memo[31];

ll f(int n) {
  if (n == 1) return 1;
  if (n == 2) return 2;
  if (n == 3) return 4;
  if (memo[n]) {
    return memo[n];
  }
  return memo[n] = f(n-1) + f(n-2) + f(n-3);
}



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

    if (n == 0) {
      break;
    }

    cout << f(n) / 10 /365  + 1<< endl;


  }

  return 0;
}

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

using namespace std;

vector<int> F;
int memo(int n)
{
    int size = F.size();

    if (n < size)
    {
        return F[n];
    }

    for (int i = size; i <= n; i++)
    {
        switch (i)
        {
        case 0:
            F.push_back(1);
            break;
        case 1:
            F.push_back(F[i - 1]);
            break;
        case 2:
            F.push_back(F[i - 1] + F[i - 2]);
            break;
        default:
            F.push_back(F[i - 1] + F[i - 2] + F[i - 3]);
            break;
        }
    }

    return F[n];
}

int main()
{
    int n;
    while (cin >> n && n)
    {
        double ans = memo(n) / (10.0 * 365.0);
        cout << (int)(ceil(ans)) << endl;
    }
    return 0;
}

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

int main()
{
  int dp[40];
  fill_n(dp, 40, 0);

  dp[0] = 1;

  for (int i = 1; i < 40; ++i) {
    for (int j = 1; j <= 3; ++j) {
      if (i-j>=0) dp[i] += dp[i-j];
    }
  }

  int n;
  while (cin >> n) {
    int ans = dp[n] / 3650;
    if (dp[n] % 3650 != 0) ans++;
    cout << ans << endl;
  }
}