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 <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)

template<typename T>
void remove(vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}

typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
long long dp[31] = {1,1,2};
void func(int n){
	for(int i = 3; i <= 30; i++){
		dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
	}
}


int main(void){
	func(30);
	int n;
	while(cin >> n, n){
		cout << dp[n]/10/365+1 << endl;
	}

	return 0;
}



int StrToInt(string s){
	stringstream ss;
	ss << s;
	int val;
	ss >> val;
	return val;
}
string IntToStr(int i){
	stringstream ss;
	ss << i;
	return ss.str();
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>

using namespace std;

typedef long long ll;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)

ll d[40];
void solve(){

}
void show(){
  for(int i=0;i<40;i++){
    cout<<i<<":"<<d[i]<<endl;
  }
}
void init(){
  fill(d,d+40,0);
  d[1]=1;
  d[2]=2;
  d[3]=4;
  for(int i=4;i<31;i++){
    d[i]=d[i-3]+d[i-2]+d[i-1];
  }
}
int main(){
  int n;
  init();
  show();
  while(cin >> n,n){
    cout<<(d[n]/3650)+1<<endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    while(true){
        int y=0,n;
        int a[31]={0};
        cin>>n;
        if(n==0) break;
        a[1]=1;
        a[2]=2;
        a[3]=4;
        for(int i=4; i<31; i++){
            a[i]=a[i-1]+a[i-2]+a[i-3];
        }
        y=(a[n]/10)/365+1;
        cout<<y<<endl;
    }
}

C++: #include <iostream>
using namespace std;
int trib(int a){
	if(a==1){return 1;}
	if(a==2){return 2;}
	if(a==0){return 1;}
//	if(a==3){return }
	return trib(a-3)+trib(a-2)+trib(a-1);
}
int main() {
	// your code goes here
int a;
while(true){
	cin>>a;
	if(a==0){return 0;}
cout<<((trib(a)+1)/10+1)/365+1<<endl;
	
}
	return 0;
}

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

using namespace std;

int memo[31];

int solve(int remain){
    int cnt = 0;

    if(memo[remain] != -1) return memo[remain];

    if(remain <= 0) return 0;
    if(remain == 1) return 1;
    if(remain == 2) return 2;
    if(remain == 3) return 4;

    for(int i=1;i<=3;++i){
        cnt += solve(remain - i);
    }

    return memo[remain] = cnt;
}


int main(void){
    int n;
    int val;

    while(cin >> n, n > 0){
        memset(memo,-1,sizeof(int)*31);

        val = solve(n)/10;
        val = val < 366 ? 1 : val % 365 == 0 ? val / 365 : val/365 + 1;
        cout << val << endl;
    }
}

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

int dp[31];

int main() {
	while(1){
		int n;
		cin >> n;
		if(n == 0)break;
	
		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];
		
		int ans = (dp[n] % 3650 == 0) ? dp[n] /3650 : dp[n] / 3650 + 1;
	
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int dp[31], n, i, result[100];

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

	for (int a = 3; a < 31; a++)
	{
		dp[a] = dp[a - 1] + dp[a - 2] + dp[a - 3];
	}

	for (;; i++)
	{
		cin >> n;
		if (n == 0)
		{
			break;
		}
		result[i] = dp[n] / 3650 + 1;
	}

	for (int a = 0; a < i; a++)
	{
		cout << result[a] << endl;
	}


	return 0;
}