#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const int INF = 1e9;
const int MOD = 17;
using vec = vector<ll> ;
using mat =  vector<vec>;

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++){
                                C[i][j] = (C[i][j] + A[i][k]*B[k][j]) % MOD;
                        }
                }
        }
        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] = 1;
        while(n > 0){
                if(n & 1) B = mul(B,A);
                A = mul(A,A);
                n >>= 1;
        }
        return B;
}

int main(){
    int q;
    cin >> q;
    vec four = {1,0,0,0};
    mat A = {{1,1,1,1},
             {1,0,0,0},
             {0,1,0,0},
             {0,0,1,0}};
    while(q--){
        ll n;
        cin >> n;
        if(n<=4){
            cout << four[4-n] << endl;
            continue;
        }
        mat B = pow(A,n-4);
        ll ans = 0;
        rep(i,4){
            ans = (ans + (B[0][i] * four[i])%MOD)%MOD;
        }
        cout << ans << endl;
    }
    return 0;
}