#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 17;
double EPS = 1e-8;

ll dp[1000010];

ll calc(int n) {
    if(dp[n] != -1) return dp[n];
    ll sum = 0LL;
    rep(i, 4) sum += calc(n-1-i);
    sum %= MOD;
    return dp[n] = sum;
}

int main(){
    int q;
    cin >> q;
    REP(i, 5, 1000010) dp[i] = -1;
    dp[4] = 1;
    rep(i, q) {
        int n;
        cin >> n;
        cout << calc(n) << endl;
    }
    return 0;
}