#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N, M;

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    
    cin >> N;
    
    M = 4912;
    int T[M];
    // 4912 -> 0に戻る
    // 4912のMODで計算する
    T[0] = T[1] = T[2] = 0;
    T[3] = 1;
    REP(i, M) {
        if (i < 4) continue;
        T[i] = (T[i-1] + T[i-2] + T[i-3] + T[i-4]) % 17;
    }
    int q;
    REP(i, N) {
        cin >> q;
        cout << T[q % M - 1] << endl;
    }
    
    return 0;
}