#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

// 4912
int A[5000];

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

    A[3] = 1;
    for(int i=0;i+4<5000;++i){
        A[i+4] = (A[i+3] + A[i+2] + A[i+1] + A[i]) % 17;
    }

    int Q;
    std::cin >> Q;

    for(int i=0;i<Q;++i){
        ll N;
        std::cin >> N;

        --N;
        N %= 4912;

        std::cout << A[N] << std::endl;   
    }
}