#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include<iomanip>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

int T[1000009];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	T[1] = T[2] = T[3] = 0; T[4] = 1;
	for (int i = 5; i <= 1000000; i++) {
		T[i] = T[i - 1] + T[i - 2] + T[i - 3] + T[i - 4];
		T[i] %= 17;
	}

	int Q; cin >> Q;
	vector<int> ans;
	for (int i = 0; i < Q; i++) {
		int n; cin >> n;
		ans.push_back(T[n]);
	}

	for (int i = 0; i < Q; i++) cout << ans[i] << endl;


	return 0;
}