#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long LL;
struct X{
	int index;
	LL n;
	int val;
};
bool CompN(X &l, X &r){
	return l.n<r.n;
}
bool CompI(X &l, X &r){
	return l.index<r.index;
}
int main(int argc, char* argv[])
{
	int Q;
	cin>>Q;
	int i;
	vector<X> N(Q);
	for (i=0;i<Q;i++){
		cin>>N[i].n;
		N[i].index=i;
		N[i].val=0;
	}
	sort(N.begin(),N.end(),CompN);
	vector<int> T1;
	T1.push_back(0);
	T1.push_back(0);
	T1.push_back(0);
	T1.push_back(1);
	LL t=4;
	for (i=0;i<Q;i++){
		switch(N[i].n){
		case 1:
		case 2:
		case 3:
			break;
		case 4:
			N[i].val=1;
			break;
		default:
			int Sum;
			while (t<N[i].n){
				Sum=(T1[0]+T1[1]+T1[2]+T1[3])%17;
				T1.push_back(Sum);
				T1.erase(T1.begin());
				t++;
			}
			N[i].val=T1[3];
			break;
		}
	}
	sort(N.begin(),N.end(),CompI);
	for (i=0;i<Q;i++){
		cout<<N[i].val<<endl;
	}
	return 0;
}