#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {

    int a[4912] = {0};
    
    a[0] = 0; a[1] = 0; a[2] = 0; a[3] = 1;
    for ( int i = 4; i < 4912; i++ ) {
        a[i] = (a[i-1] + a[i-2] + a[i-3] + a[i-4])%17;
    }
    
    int Q;
    cin >> Q;
    vector<long long> N(Q);
    for ( int i = 0; i < Q; i++ ) {
        cin >> N[i];
        N[i]--;        
    }
    for ( int i = 0; i < Q; i++ ) {
        cout << a[N[i]%4912] << endl;
    }
    return 0;

}