// yukicoder: No.657 テトラナッチ数列 Easy
// 2019.4.22 bal4u
// 周期性に注目。周期 4912

#include <stdio.h>
#include <string.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in()
{
	int n = 0, c = gc();
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

void out(int n)
{
	int i;
	char ob[20];

	if (!n) pc('0');
	else {
		i = 0; while (n) ob[i++] = n%10 + '0', n/=10;
		while (i--) pc(ob[i]);
	}
	pc('\n');
}

#define MOD 17
#define PERIOD 4912
int a[5000] = {0,0,0,1,1,2,4,8,15,29};

int main()
{
	int i, Q;
	for (i = 5; i < 5000; i++) {
		a[i] = (a[i-4]+a[i-3]+a[i-2]+a[i-1]) % MOD;
	}
	Q = in(); while (Q--) out(a[(in()-1) % PERIOD]);
	return 0;
}