#include <bits/stdc++.h>
//#include "atcoder/all"
typedef long long int ll;
using namespace std;
// using namespace atcoder;
#define P 17 * 17 * 17 * 17
int l[P];
int first[P];
int main() {
    int q;
    cin >> q;
    memset(first, -1, sizeof(first));
    int a1 = 0;
    int a2 = 0;
    int a3 = 0;
    int a4 = 1;
    int now = 3;
    int nowp = a1 * 17 * 17 * 17 + a2 * 17 * 17 + a3 * 17 + a4;
    int syuuki;
    first[nowp] = now;
    l[0] = 0;
    l[1] = 0;
    l[2] = 0;
    l[now] = nowp;
    while (true) {
        int temp = (a1 + a2 + a3 + a4) % 17;
        a1 = a2;
        a2 = a3;
        a3 = a4;
        a4 = temp;
        now++;
        nowp = a1 * 17 * 17 * 17 + a2 * 17 * 17 + a3 * 17 + a4;
        if (first[nowp] == -1) {
            first[nowp] = now;
            l[now] = nowp;
        }
        else {
            // cout << now << endl;
            syuuki = now - first[nowp];
            break;
        }
    }
    int kijun = first[nowp];
    // cout << kijun << endl;
    // for (int i = 0; i < 50; i++) {
    //     cout << l[i] << endl;
    // }
    for (int i = 0; i < q; i++) {
        ll n;
        cin >> n;
        n--;
        //l[(n - kijun) % syuuki + kijun]
        if (n >= kijun) {
            cout << l[(n - kijun) % syuuki + kijun] % 17 << endl;
        }
        else {
            cout << l[n] % 17 << endl;
        }
    }
    return 0;
}