#include <bits/stdc++.h>
#define REP(i, a, b) for(int i = (a); i < (b); i++)
#define RREP(i, a, b) for(int i = (a); i >= (b); i--)
#define pq priority_queue
#define P pair<int, int>
#define P2 pair<int, P>
#define P3 pair<int, P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF = 1e9, MOD = 1e9+7, around[] = {0, 1, 1, -1, -1, 0, -1, 1, 0, 0};
const int vx[] = {1, 0, -1, 0}, vy[] = {0, 1, 0, -1};
const ld PI = abs(acos(-1));
const int sqrtN = 512;
const int logN = 32;
const ll LINF=1e18;

int main(){
	int q; cin >> q;
	
	int a[1000010] = {};
	a[0] = a[1] = a[2] = 0; a[3] = 1;
	for(int i = 4; i < 1000010; i++) a[i] = (a[i - 1] + a[i - 2] + a[i - 3] + a[i - 4]) % 17;
	
	for(int i = 0; i < q; i++){
		int k; cin >> k;
		
		cout << a[k - 1] << endl;
	}
		
	return 0;
}