#include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <numeric>
#include <limits>
#include <bitset>
using namespace std;

#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
 
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int,int> pii;

const int INF = 1<<29;
const double EPS = 1e-10;
double zero(double d){
  return d < EPS ? 0.0 : d;
}

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
    return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& a){
    os<<'[';
    rep(i,a.size()) os<<(i?" ":"")<<a[i];
    return os<<']';
}

const int M = 1000000007;

// a^k
ll fpow(ll a, ll k){
  ll res = 1ll;
  ll x = a;
  while( k!=0 ){
    if((k&1) == 1)
      res = res*x;
    x = x*x;
    k >>= 1;
  }
  return res;
}

int used[31];

int loop(int a){

  if(used[a]!=-1)
    return used[a];

  if(a==1)
    return 1;
  else if(a==2)
    return 2;
  else if(a==3)
    return 4;
  else 
    return (used[a] = loop(a-1) + loop(a-2) + loop(a-3));
}


int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(8);
  ios_base::sync_with_stdio(false);
  
  int n;
  while(cin>>n, n){
    memset(used,-1,sizeof(used));
    cout << (int)ceil( (double)loop(n)/365/10 )  << endl;
  }


  return 0;
}