#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
    int Q;
    cin >> Q;
    long n[Q];
    for (int i = 0; i < Q; i++){
        cin >> n[i];
    }
    vector<int> tetranatti = {0, 0, 0, 1, 1};
    for(int i = 1; true; i++){
        if(tetranatti[i] == 0 && tetranatti[i + 1] == 0 && tetranatti[i + 2] == 0 && tetranatti[i + 3] == 1){
            break;
        }else{
            tetranatti.push_back((tetranatti[i] + tetranatti[i + 1] + tetranatti[i + 2] + tetranatti[i + 3]) % 17);
        }
    }
    for(int i = 0; i < Q; i++){
        cout << tetranatti[(n[i] - 1) % tetranatti.size()] << endl;
    }
}