/* #region Head */

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

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> ostream &operator<<(ostream &os, array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

ostream &operator<<(ostream &os, const __int128_t &v) {
    if (v == 0) {
        return (os << "0");
    }
    __int128_t num = v;
    if (v < 0) {
        os << '-';
        num = -num;
    }
    string s;
    for (; num > 0; num /= 10) {
        s.push_back((char)(num % 10) + '0');
    }
    reverse(s.begin(), s.end());
    return (os << s);
}

/* #region miller */

// ミラー・ラビン素数判定法クラス
template <typename T = ull> class Miller {
    const vc<vc<T>> bases = {{2, 3},
                             {2, 299417},
                             {2, 7, 61}, // < 4,759,123,141
                             {15, 176006322, 4221622697ull},
                             {2, 2570940, 211991001, 3749873356ull},
                             {2, 2570940, 880937, 610386380, 4130785767ull},
                             {2, 325, 9375, 28178, 450775, 9780504, 1795265022ull}};

    // x^k (mod m) を返す
    inline T modpow(T x, T k, const T &m) {
        T res = 1;
        while (k) {
            if (k & 1) res = res * x % m;
            k /= 2;
            x = x * x % m;
        }
        return res;
    }

    // 合成数とわかったら true を返す
    inline bool is_composite(T n, T a, T s, T d) {
        if (a == n) return false;
        if (modpow(a, d, n) != 1) { // a^d mod n != 1
            bool composite = true;
            // for (T r = 0; r < s; ++r) {                          // [0, s) の範囲の全ての r について
            //     if (modpow(a, d * ((T)1ull << r), n) == n - 1) { // a^(2^r * d) mod n != -1 じゃない
            //         composite = false;
            //         break;
            //     }
            // }
            a = modpow(a, d, n);
            if (a == n - 1) return false; // 合成数とは言い切れない
            for (T r = 1; r < s; ++r) {
                a = (a * a) % n;
                // pprint("aa", a);
                if (a == n - 1) { // a^(2^r * d) mod n != -1 じゃない
                    // dump(n, a, s, d, n - 1);
                    composite = false;
                    break;
                }
            }
            return composite;
        }
        return false; // 合成数とは言い切れない
    }

  public:
    // n が素数かどうか判定する
    bool is_probably_prime(const T &n) {
        if (n < 2) return false;
        if (!(n & 1)) return n == 2;
        if (n <= 8) return true;

        // base 選択
        int x = (n < 1373653ull) ? 0 :                                 //
                    (n < 19471033ull) ? 1 :                            //
                        (n < 4759123141ull) ? 2 :                      //
                            (n < 154639673381ull) ? 3 :                //
                                (n < 47636622961201ull) ? 4 :          //
                                    (n < 3770579582154547ull) ? 5 : 6; //

        // n-1 を 2 の冪乗で割って，2^s * d の形にする
        T d = n - 1;
        T s = 0;
        while (d % 2 == 0) {
            d /= 2;
            s++;
        }
        // dump(x);
        for (const T &a : bases[x]) { // [1, n-1] から a を選ぶ
            if (is_composite(n, a, s, d)) {
                // dump(n, a, s, d);
                return false; // 合成数なら false を返す
            }
        }
        return true; // probably prime
    }
};

/* #endregion */

// Problem
void solve() {
    VAR(ll, n);
    Miller<__int128_t> miller; ///
    REP(i, 0, n) {
        VAR(ll, x); //
        pprint(x, miller.is_probably_prime(x));
    }
}

// entry point
int main() {
    solve();
    return 0;
}