#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
//#define N (1000000000+7)
//#define N (998244353)
#define N 17
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef vector<ll> vec;
typedef vector<vec> mat;

mat  mul(mat &A,mat &B){
    mat C(A.size(),vec(B[0].size()));
    for(int i=0;i<A.size();i++){
        for(int k=0;k<B.size();k++){
            for(int j=0;j<B[0].size();j++){
                ll t = (A[i][k]*B[k][j])%N;
                C[i][j] = (C[i][j]+t)%N;
                C[i][j] = (C[i][j]+N)%N;
            }
        }
    }
    return C;
}

mat Pow(mat A,ll n){
    mat B(A.size(),vec(A.size()));
    for(int i=0;i<A.size();i++)B[i][i]=1LL;
    while(n>0){
        if(n&1)B = mul(B,A);
        A = mul(A,A);
        n>>=1;
    }
    return B;
}

int main(void){
    ll Q;
    cin>>Q;
    mat A(4,vec(4));
    for(int i=0;i<4;i++){
        A[0][i]=1;
    }
    A[1][0]=1;
    A[2][1]=1;
    A[3][2]=1;
    while(Q--){
        ll n;
        cin>>n;
        if(n<=3){
            cout<<0<<endl;
            continue;
        }
        if(n==4){
            cout<<1<<endl;
            return 0;
        }
        mat Ans(4,vec(4));
        Ans = Pow(A,n-4);
        cout<<Ans[0][0]<<endl;
    }
}