#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<31)-1
#define MOD 17
#define all(x) (x).begin(),(x).end()
#define vii vector<int>
#define vll vector<long long>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

int q, dp[10000005];

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
    cin >> q;
    memset(dp, 0, sizeof(dp));
    rep(i, 0, 4) dp[i] = 0;
    dp[4] = 1;
    rep(i, 5, 1000005) {
        dp[i] = (dp[i-1] % MOD) + (dp[i-2] % MOD) + (dp[i-3] % MOD) + (dp[i-4] % MOD);
    }
    while (q--) {
        int p; cin >> p;
        cout << dp[p] % MOD << endl;
    }
    return 0;
}