#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
set<tuple<int, int, int, int>>st;
int t[5000];
int main() {
    t[0] = 0, t[1] = 0, t[2] = 0, t[3] = 1;
    int a = 0, b = 0, c = 0, d = 1;
    for (int i = 4; i < 100000; i++) {
        if (st.find(make_tuple(a, b, c, d)) != st.end()) {
            break;
        }
        st.insert(make_tuple(a, b, c, d));
        int a1 = b, b1 = c, c1 = d, d1 = a + b + c + d;
        d1 %= 17;
        t[i] = d1;
        a = a1, b = b1, c = c1, d = d1;
    }
    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        long long n;
        cin >> n;
        n--;
        cout << t[n % 4912] << endl;
    }
}