#include <iostream>
#include <algorithm>
using namespace std;

int main(){
	int Q;
	cin >> Q;
	int n[Q];
	for(int i = 0; i < Q; i++){
		cin >> n[i];
	}
	int max_n = 4;
	for(int i = 0; i < Q; i++){
		max_n = max(max_n, n[i]);
	}
    int tetranatti[max_n];
    tetranatti[0] = 0;
    tetranatti[1] = 0;
    tetranatti[2] = 0;
    tetranatti[3] = 1;
    for(int i = 4; i < max_n; i++){
        tetranatti[i] = (tetranatti[i - 1] + tetranatti[i - 2] + tetranatti[i - 3] + tetranatti[i - 4]) % 17;
    }
    for(int i = 0; i < Q; i++){
    	cout << tetranatti[n[i] - 1] << endl;
    }
}