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 <algorithm>
#include <cmath>
#include <iostream>
#include <stack>

class steps
{
public:
    steps(const std::size_t l)
        :walk_limit_(l), walk_size_(), permutation_size_()
    {
        for(std::size_t i = 0; i < walk_limit_; ++i)
        {
            this->push(1);
        }
    };

    void step()
    {
        while(!this->done())
        {
            this->next();
        }
    }

    std::size_t permutation()const
    {
        return permutation_size_;
    }

private:
    void next()
    {
        if(this->formed())
        {
            ++permutation_size_;
            this->inc();
        }
        else if(this->overflow())
        {
            this->pop();
            this->inc();
        }
        else
        {
            this->push(1);
        }
    }

    void inc()
    {
        if(current_pattern_.empty()){return;}
        if(3 == this->top())
        {
            this->pop();
            if(current_pattern_.empty()){return;}
            this->inc();
        }
        else
        {
            ++this->top();
            ++walk_size_;
        }
    }
    
    void push(const std::size_t p)
    {
        walk_size_ += p;
        current_pattern_.push(p);
    }

    void pop()
    {
        walk_size_ -= current_pattern_.top();
        current_pattern_.pop();
    }

    std::size_t& top()
    {
        return current_pattern_.top();
    }

    bool formed()const
    {
        return walk_limit_ == walk_size_;
    }

    bool overflow()const
    {
        return walk_limit_ < walk_size_;
    }

    bool done()const
    {
        return current_pattern_.empty();
    }

    std::stack<std::size_t> current_pattern_;
    std::size_t walk_limit_;
    std::size_t walk_size_;
    std::size_t permutation_size_;
};

std::size_t permutation(const std::size_t limit)
{
    steps s(limit);
    s.step();
    return s.permutation();
}

std::size_t year(const std::size_t perm)
{
    return std::ceil(static_cast<double>(perm) / 10.0 / 365.0);
}

int main()
{
    for(std::size_t n; std::cin >> n, n != 0;)
    {
        std::cout << year(permutation(n)) << std::endl;
    }
}

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

int n;
long long dp[31];

int main(){
    while(scanf("%d", &n), n){
        memset(dp, 0, sizeof(dp));
        
        dp[0] = 1;
        for(int j = 0; j <= n; ++j){
            for(int i = 1; i <= 3; ++i){
                if(j + i <= n)
                    dp[j + i] += dp[j];
            }
        }
        
        std::cout << dp[n] / 3650 + (dp[n] % 3650 != 0) << std::endl;
    }
    
    return 0;
}

C++: #include<iostream>

using namespace std;

int kei(int n) {
	long int ans;
	if (n == 1)return 1;
	else if (n == 2)return 2;
	else if (n == 3)return 4;
	else
	{
		ans = kei(n - 1) + kei(n - 2) + kei(n - 3);
		return ans;
	}
}



int main() {
	long int N[1000],ans[1000],c=0,c2;
	while (1) {
		cin >> N[c];
		if (N[c] == 0)break;
		ans[c] = kei(N[c]);
		++c;
	}
	c = 0;

	while (true) {
		if (N[c] == 0)break;
		else
		{
			cout << ans[c]<<endl;
			++c;
		}

	}

}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
  
  int N;
  while(cin >> N && N) {
    int dp[35] = {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]/3650 + (dp[N]%3650?1:0) << endl;
  }
  
  return 0;
}

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

int main()
{
  string s;
  cin >> s;
  cout << num(stoi(strPlus)) <<endl;
  return 0;
}

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