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 <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){
	if(num < 0) return 0;
	if(memo[num] != -1) return memo[num];
	if(num <= 1) return memo[num] = 1;

	return memo[num] = dp(num-1) + dp(num-2) + dp(num-3);
}

C++: #include <iostream>
using namespace std;
int num(int n);
int main(){
  int n;cin >> n;
  cout << num(num(n)) <<endl;
}

int num(int n){
  if(n<1)return 0;
  if(n=1)return 1;
  return num(n-1)+num(n-2)+num(n-3);
}

C++: #include <iostream>

using namespace std;

long long int kaidan (int n) {
	if (n == 0) {
		return 1;
	} else {
		if (n >= 3) {
			return kaidan(n-3)+kaidan(n-2)+kaidan(n-1);
		} else if (n > 1) {
			return kaidan(n-2)+kaidan(n-1);
		} else {
			return kaidan(n-1);
		}
	}
}


int main() {
	int n;
	while (cin >> n) {
		if (n == 0) {
			break;
		}
		long long int a = kaidan(n);
		long long int b;
		b = a / 10;
		if (a % 10 != 0) {
			b++;
		}
		a = b / 365;
		if (b % 365 != 0) {
			a++;
		}
		cout << a << endl;
	}
	return 0;
}

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

int main() {
	int DP[34]={0};
	int x;
	DP[0]=1;

	for(int i=0;i<=29;i++){
		for(int j=1;j<=3;j++)
		DP[i+j]+=DP[i];
	}
	while(true){
		cin >> x;
		if(x==0)
		break;
		cout << (DP[x]+3649)/3650 << endl; 
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int dfs(int n, int dan){

	if(dan == n){
		return 1;
	}
	else if(dan > n){
		return 0;
	}
	else{
		int count = 0;
		count = count + dfs(n, dan + 1);
		count = count + dfs(n, dan + 2);
		count = count + dfs(n, dan + 3);
		return count;
	}
}

int main(){
	
	int n;

	while(1){
		cin>>n;

		if(n == 0) break;

		cout<<dfs(n,0) / 10 / 365 + 1<<endl;
	}
}

C++: #include<iostream>
#include<vector>
#include<string>
#include <cmath>
#define rep(i,n) for(int i = 0;i < (int)(n);i++)
using namespace std;


int state(int n) {
	long long dp[35];
	int ans = 0;
	rep(i, 35)dp[i] = 0;
	dp[0] = 1;
	rep(i, n) {
		dp[i + 1] += dp[i];
		dp[i + 2] += dp[i];
		dp[i + 3] += dp[i];
	}
	ans = ceil(double(dp[n]) / 3650.0);
	return ans;
}

int main() {
	int n, m, a = 0;
	cin >> n;
	do {
		cout << state(n) << endl;
		cin >> n;
	} while (n > 0);
	return 0;
}

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

int dp[31];

void solve(int n)
{
  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 main()
{
  int n;
  while(1){
    cin >> n;
    if(n == 0){
      break;
    }else{
      solve(n);
      cout << ceil((double) (ceil((double) dp[n] / 10) / 365)) << endl;
    }
  }
}

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

int main(){
	int n=1;
	double ans =0;
	int checkc = 0;
	int i = 4;
	double check[3] = { 1, 2, 4 };
	
	while (n != 0){
		cin >> n;

		switch (n){
		case 1:
			ans = 1;
			break;
		case 2:
			ans = 2;
			break;
		case 3:
			ans = 4;
			break;
		default:
			while (n >= i){
				ans = check[0] + check[1] + check[2];
				i++;
				check[0] = check[1];
				check[1] = check[2];
				check[2] = ans;
			}
		}

		ans = ans / 3650;
		checkc = (int)(ans);

		if (ans > (double)(checkc)){
			checkc++;
		}
		if (ans != 0){
			cout << checkc << endl;
		}
		else{
			cout << endl;
		}
	}
	return 0;
}