#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
using mat = vector<llvec>;

mat prod(mat a, mat b){
  mat ans(4, llvec(4, 0));
  rep(i, 4){
    rep(j, 4){
      rep(k, 4){
        ans[i][j] = (ans[i][j]+a[i][k]*b[k][j])%17;
      }
    }
  }
  return ans;
}


/**************************************
** A main function starts from here  **
***************************************/
int main(){
  ll Q;
  cin >> Q;
  mat A = {{1, 1, 1, 1},
           {1, 0, 0, 0},
           {0, 1, 0, 0},
           {0, 0, 1, 0}};
  while(Q--){
    mat e(4, llvec(4, 0));
    rep(i, 4)e[i][i] = 1;
    ll q;
    cin >> q;
    if(q<=3){
      cout << 0 << endl;
      continue;
    }else if(q==4){
      cout << 1 << endl;
      continue;
    }
    q-=4;
    auto a = A;
    while(q>0){
      if(q%2==1){
        e = prod(a, e);
      }
      a = prod(a, a);
      q/=2;
    }
    cout << e[0][0]<<endl;
  }
  
  return 0;
}