#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<int> vec;
typedef vector<vec> mat;

const int M = 17;

mat mul(mat &A, mat &B){
  mat C(A.size(),vec(B[0].size()));
    REP(i,A.size())REP(k,B.size())REP(j,B[0].size()){
    C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % M;
  }
  return C;
}

mat pow(mat A,ll n)
{
  mat B(A.size(),vec(A.size()));
  REP(i,A.size()){
    B[i][i] = 1;
  }
  while(n > 0){
    if ( n & 1) B = mul(B,A);
    A = mul(A,A);
    n >>= 1;
  }
  return B;
}

int main()
{
  int Q;
  mat A(4,vec(4));
  A[0][0] = 1;
  A[0][1] = 1;
  A[0][2] = 1;
  A[0][3] = 1;
  A[1][0] = 1;
  A[1][1] = 0;
  A[1][2] = 0;
  A[1][3] = 0;
  A[2][0] = 0;
  A[2][1] = 1;
  A[2][2] = 0;
  A[2][3] = 0;
  A[3][0] = 0;
  A[3][1] = 0;
  A[3][2] = 1;
  A[3][3] = 0;
  ll n;
  cin >> Q;
  REP(i,Q){
    cin >> n;
    mat B = pow(A,n-1);
    cout << B[3][0] << endl;
  }
  
  return 0;
}