#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define debugB(x, y) cerr<<#x<<": "<<bitset<y>(x) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};

template<typename T>
void printA(vector<T> &printArray, char between = ' ') {
   int paSize = printArray.size();
   for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}
   if (between != '\n') {cerr << endl;}
}

// ------------------------------------------------------------------------------------------

const ll N = 11111111;
// const ll N = 1e18+1;
ll q;
ll T[N];

int main() {
   T[4] = 1;
   repp (i, 5, N-1) {
      // T[i] = T[i-1] + T[i-2] + T[i-3] + T[i-4];
      T[i] = T[i-1]%17 + T[i-2]%17 + T[i-3]%17 + T[i-4]%17;
      T[i] = T[i]%17;
   }


   // ll a[] = {0, 0, 0, 1, 1, 2, 4, 8, 15, 12, 5, 6, 4};

   // ll old = 0;
   // repp (i, 0, 100000) {
   //    bool ok = true;
   //    rep (j, 12) {
   //       if (T[i+j] != a[j]) ok = false;
   //    }
   //    if (ok) {
   //       printf("(%d)dif = %lld, %d, %d\n", i, i - old, i%4913, i/4913);
   //       old = i;
   //    }

   // }
   // cout << endl;

   cin >> q;
   rep (i, q) {
      ll n;
      cin >> n;
      // n = (n % 4913LL) + (n / 4913)%4913 + 1;
      // n = n % 4913;
      n = n % 4912;
      cout << T[n] << endl;
   }

   return 0;
}