#include using namespace std; #define INF_LL (ll)1e18 #define INF (int)1e9 #define REP(i, n) for(int i = 0;i < (n);i++) #define FOR(i, a, b) for(int i = (a);i < (b);i++) #define all(x) x.begin(),x.end() #define fs first #define sc second using int32 = int_fast32_t; using uint32 = uint_fast32_t; using int64 = int_fast64_t; using uint64 = uint_fast64_t; using PII = pair; using PLL = pair; const double eps = 1e-10; templateinline void chmin(A &a, B b){if(a > b) a = b;} templateinline void chmax(A &a, B b){if(a < b) a = b;} using mat = vector>; mat mul(mat a, mat b){ mat res = mat(a[0].size(), vector(b[0].size(), 0)); REP(i, a.size()){ REP(j, b[0].size()){ REP(k, a[0].size()){ res[i][j] = res[i][j]+a[i][k]*b[k][j]; } res[i][j] %= 17; } } return res; } mat are(int32 x){ mat res = mat(x, vector(x, 0)); REP(i, x) res[i][i] = 1; return res; } mat matpow(mat a, int64 b){ if(b == 0) return are(a.size()); if(b%2) return mul(a, matpow(a, b-1)); mat x = matpow(a, b/2); return mul(x, x); } map, int32> mp; map mp2; int32 dp[1123456] = {}; int32 l, r; int main(void){ cin.tie(0); ios::sync_with_stdio(false); vector x = {0, 0, 0, 1}; mp[x] = 0; int32 Q; cin >> Q; mat org = { {0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 1, 1, 1} }; mat start = { {0}, {0}, {0}, {1} }; REP(i, Q){ int64 n; cin >> n; if(n < 4) cout << 0 << endl; else if(n == 4) cout << 1 << endl; else{ mat res = mul(matpow(org, n-4), start); cout << res[3][0] << endl; } } }