#include <algorithm>
#include <iostream>
#include <vector>

void solve(std::vector<uint32_t>& n) {
    const uint32_t n_max = *std::max_element(n.begin(), n.end());
    std::vector<uint32_t> a{0, 0, 0, 1};
    a.resize(n_max);
    for (uint32_t i = 4; i < n_max; ++i) {
        a[i] = (a.at(i - 4) + a.at(i - 3) + a.at(i - 2) + a.at(i - 1)) % 17;
    }
    for (auto i : n) {
        std::cout << a[i - 1] << std::endl;
    }
}
int32_t main() {
    uint32_t q;
    std::cin >> q;
    std::vector<uint32_t> n{};
    for (uint32_t i = 0; i < q; ++i) {
        uint32_t m;
        std::cin >> m;
        n.push_back(m);
    }
    solve(n);
}