#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

const int mod = 17;
const int NMAX = 1000000;
ll t[NMAX];

void init(){
  t[3] = 1;
  for (int i = 4; i < NMAX; i++) {
    (t[i] = t[i-1] + t[i-2] + t[i-3] + t[i-4]) %= mod;
  }
}

int main(){

  int q;
  cin >> q;
  init();
  rep(i,q) {
    int n;
    cin >> n;
    cout << t[--n] << endl;
  }
  return 0;
}