#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
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++) {
                C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % 17;
            }
        }
    }
    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;
}

void solve() {
    ll q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        ll n;
        cin >> n;

        mat A(4, vec(4));
        A[0][0] = 1; A[0][1] = 1; A[0][2] = 1; A[0][3] = 1;
        A[1][0] = 1; A[1][1] = 0; A[1][2] = 0; A[1][3] = 0;
        A[2][0] = 0; A[2][1] = 1; A[2][2] = 0; A[2][3] = 0;
        A[3][0] = 0; A[3][1] = 0; A[3][2] = 1; A[3][3] = 0;
        A = pow(A, n);

        cout << A[3][3] << '\n';
    }
}

int main() {
    solve();
    return 0;
}