# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
const int N = 1000000;
const ll INF = std::numeric_limits<long long>::max();
#define rep(i,n) for(ll i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define sz size
const ll mod = 17;
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll q, v[1000001],n;
int main() {
	cin >> q;
	v[0] = 0; v[1] = 0; v[2] = 0; v[3] = 1;
	for (ll i = 4; i < 1000001; ++i) { v[i] = v[i - 1] + v[i - 2] + v[i - 3] + v[i - 4]; v[i] %= mod; }
	rep(i, q) {
		cin >> n;
		cout << v[n - 1] << endl;
	}
	return 0;
}