#include <bits/stdc++.h>
using namespace std;

const long long mod = 17;
vector<vector<long long>> matprod(vector<vector<long long>> m1, vector<vector<long long>> m2, int n, int l, int m){
    vector<vector<long long>> y(n, vector<long long>(m));
    for (int i=0;i<n;i++){
        for (int j=0;j<m;j++){
            for (int k=0;k<l;k++){
                y[i][j] += m1[i][k] * m2[k][j] % mod;
                y[i][j] %= mod;
            }
        }
    }
    return y;
}
vector<vector<long long>> matpow(vector<vector<long long>> m1, int n, long long m){
    vector<vector<long long>> y(n, vector<long long>(n));
    vector<vector<long long>> bas = m1;
    for (int i=0;i<n;i++){
        y[i][i] = 1;
    }
    long long tmp = m;
    while (tmp != 0){
        if (tmp % 2 == 1){
            y = matprod(y, bas, n, n, n);
        }
        bas = matprod(bas, bas, n, n, n);
        tmp /= 2;
    }
    return y;
}
int main(void){
    // Your code here!
    int Q;
    cin >> Q;
    vector<long long> vec = {0, 0, 0, 1};
    vector<vector<long long>> mat = {
        {0, 1, 0, 0},
        {0, 0, 1, 0},
        {0, 0, 0, 1},
        {1, 1, 1, 1}
    };
    long long n;
    long long S;
    vector<vector<long long>> M;
    for (int _=0;_<Q;_++){
        cin >> n;
        M = matpow(mat, 4, n-1);
        S = 0;
        for (int i=0;i<4;i++){
            S += vec[i] * M[0][i] % mod;
            S %= mod;
        }
        cout << S << endl;
    }
    return 0;
}