#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

using namespace std;

#ifdef __LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 2e5 + 20;
#endif

//tg: @galebickosikasa

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());



signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int q;
	cin >> q;
	while (q--) {
		int n;
		cin >> n;
		vector<int> goo (n);
		cinv (goo);
		int ans = 0;
		while (1) {
			int mn = -1, mx = -1;
			fr (i, n) {
				if (goo[i] > 0) {
					if (goo[i] % 2) {
						if (mn == -1 || goo[i] < goo[mn]) mn = i;
					} else {
						if (mx == -1 || goo[i] > goo[mx]) mx = i;
					}
				}
			}
			int cnt = 0;
			if (mn != -1) {
				--goo[mn];
				if (goo[mn] == 0) ++ans;
			}
			else if (mx != -1) --goo[mx];
			for (auto& x: goo) {
				if (x) --x;
				if (x == 0) ++cnt;
			}
			if (cnt == n) {
				cout << ans << '\n';
				break;
			}
		}
	}







}