/* -*- coding: utf-8 -*-
 *
 * 657.cc: No.657 テトラナッチ数列 Easy - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 1000000;
const int MOD = 17;

/* typedef */

/* global variables */

int ts[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  ts[1] = ts[2] = ts[3] = 0; ts[4] = 1;
  for (int i = 5; i <= MAX_N; i++)
    ts[i] = (ts[i - 1] + ts[i - 2] + ts[i - 3] + ts[i - 4]) % MOD;

  int q;
  scanf("%d", &q);

  while (q--) {
    int n;
    scanf("%d", &n);

    printf("%d\n", ts[n]);
  }
  return 0;
}