#include <bits/stdc++.h>
 
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 
#define togglebit(n, i) ((n) ^ (1LL << (i))) 
#define lastone(n) ((n) & (-(n))) 
char gap = 32;
#define int long long
#define ll long long 
#define lll __int128_t
#define pb push_back

int recurse(int n, int d) {
    if(n == 1) return 0;
    if(d == 0) return 1e18;
    int ans = 0;
    __int128_t N = n;
    __int128_t D = d;
    for(int i = 1; i <= 62; i++) {
        __int128_t temp = ((1LL << i) - 1);
        temp = temp * D + 1;
        if(temp >= N) {
            ans = i;
            break;
        }
    }
    int left = n / 2;
    int right = n - left;
    ans = min({ans, recurse(right, d - 1) + 1});
    return ans;
}
void solve() {
    int n;
    cin >> n;
    int o = 0, e = 0;
    for (int i=0; i<n; i++) {
        int x;
        cin >> x;
        if (x & 1) o++;
        else e++;
    }

    if (n % 2 == 0) {
        if (e) {
            cout << 1 << endl;
        }
        else {
            cout << 0 << endl;
        }
    } else {
        if (e == n) {
            cout << 0 << endl;
        }
        else if (e) {
            cout << 1 << endl;
        }
        else {
            cout << 0 << endl;
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t; cin >> t;
    while(t--) {
        solve();
    }
}