#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};

int T[1001001];

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

    T[4] = 1;
    for(int i=1;i+4<=1000000;++i){
        T[i + 4] = (T[i + 3] + T[i + 2] + T[i + 1] + T[i]) % 17;
    }
    
    int Q;
    std::cin >> Q;

    for(int i=0;i<Q;++i){
        int n;
        std::cin >> n;
        
        std::cout << T[n] << std::endl;
    }
}