#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); cout.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    array<bool, 100000 + 1> sieve;
    fill(begin(sieve), end(sieve), true);

    sieve[0] = sieve[1] = false;
    for (int i = 2; i <= 100000 / i; ++i) {
        if (!sieve[i]) continue;
        for (int j = i * i; j <= 100000; j += i) {
            sieve[j] = false;
        }
    }

    int t; cin >> t;
    while (t--) {
        int n; cin >> n;
        cout << sieve[n] << endl;
    }
}