http://oj.acm.zstu.edu.cn/JudgeOnline/problem.php?id=3922

题解：简单的DP题，但是数据有问题，数阻不能开long long（所以是个假题）

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
ll t,n,m,k,q,ans;
int a[1010];//正确的写法是long long 但是ZSTUOJ数据有问题只能开int
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif

    a[1]=1;
    a[2]=2;
    a[3]=4;
    a[0]=0;
    for(int i=4;i<=50;i++)
            a[i]=a[i-1]+a[i-2]+a[i-3];//cout<<a[i]<<endl;
    while(~scanf("%lld",&t))
    while(t--){
        scanf("%lld",&n);
        cout<<a[n]<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}