#include<bits/stdc++.h>

using namespace std;
    int n, m, k;
vector<array<int, 4> > v, v1;
vector<array<int, 2> > w[2222];
int d[2222], ok[3333];
vector<array<int, 2> > ans;

int gpar(int a) {
    if (d[a] == a) return a;
    return d[a] = gpar(d[a]);
}

bool dsu(int a, int b) {
    a = gpar(a);
    b = gpar(b);
    if (a == b) {
        return false;
    }
    d[a] = b;
    return true;
}

int dfs(int idx, int par, int tar, int ans) {
    //cout << idx << "< >" << tar << endl;

    if (idx == tar) {
        return ans;
    }
    for (auto it: w[idx]) {
        if (it[0] == par) {
            continue;
        }
        //cout << it[1] << "!!";
        if (ans == -1 && ok[it[1]] && it[1] >= n-1) {

            int pas = dfs(it[0], idx, tar, it[1]);
            if (pas != -1) {
                return pas;
            }
        } else if (ok[it[1]]) {
            int pas = dfs(it[0], idx, tar, ans);
            if (pas != -1) {
                return pas;
            }
        }
    }
    return -1;
}
main() {

    int t;
    cin >> t;
    while (t -- ) {
    int n, lw =0 , kn = 0;
    cin >> n;
    for (int i = 0; i < n; i ++) {
        int a;
        cin >> a;
        if (a == 2) {
            lw ++;
        }
    if (a%2 == 1) kn ++;
    }
    if ((lw == n && n%2 == 1) || kn == n) cout << 0;
    else cout << 1;
    cout << endl;
    }
}