#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c = getchar(); x = ;while(!isdigit(c)) c = getchar();

    while(isdigit(c)) { x = x *  + c - ''; c = getchar();  }

}

int a[];

int b[];

int main()

{

    b[]=; b[]=; b[]=; b[]=; b[]=;

    b[]=; b[]=; b[]=; b[]=;

    for(int i=;i<=;i++) a[i]=b[i];

    a[]=; a[]=; a[]=; a[]=; a[]=;

    a[]=; a[]=; a[]=; a[]=; a[]=;

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    a[]=; for(int i=;i<=;i++) a[i]=a[]+b[i-];

    int p;

    for(int i=;i<=;i++)

    {

        if(i%==)  p=i, a[i]=b[i/]+;

        else a[i]=a[p]++a[i-p];

    }

    a[]=;

    for(int i=;i<=;i++) a[i]=a[i]+a[i-];

    int T; scanf("%d",&T);

    while(T--)

    {

        int n; scanf("%d",&n);

        printf("%d\n",a[n]);

    }

    return ;

}