#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int MOD = 17;

typedef vector<int> vec;
typedef vector<vec> mat;

mat mul(mat& A, mat& B) {
    mat C(A.size(), vec(B[0].size(), 0));
    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] += A[i][k] * B[k][j] % MOD) %= MOD;
            }
        }
    }
    return C;
}

mat pow(mat A, ll n) {
    mat B(A.size(), vec(A.size(), 0));
    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 solve(ll n) {
    if (n < 3) return 0;
    if (n == 3) return 1;
    n -= 3;
    mat A(4, vec(4, 0));
    A[0][0] = 1;
    A[0][1] = 1;
    A[0][2] = 1;
    A[0][3] = 1;
    A[1][0] = 1;
    A[2][1] = 1;
    A[3][2] = 1;
    A = pow(A, n);
    return A[0][0];
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        ll n;
        cin >> n;
        n--;
        cout << solve(n) << endl;
    }
    return 0;
}