#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod=998244353;
const ll INF = -10000000000000;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) cin >> x;
sort(a.begin(), a.end());
int best = n-1;
for (int p = 0; p < 2; ++p) {
int l = -1, r = -1;
for (int i = 0; i < n; ++i) {
if ((a[i] & 1) == p) {
if (l == -1) l = i;
r = i;
}
}
if (l != -1) {
int cond = l + (n - 1 - r);
best = min(best, cond);
}
}
cout << best << "\n";
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTW9kPTk5ODI0NDM1MzsKY29uc3QgbGwgSU5GID0gLTEwMDAwMDAwMDAwMDAwOwoKdm9pZCBzb2x2ZSgpIHsKICAgaW50IG47CiAgICAgICAgY2luID4+IG47CiAgICAgICAgdmVjdG9yPGludD4gYShuKTsKICAgICAgICBmb3IgKGludCAmeCA6IGEpIGNpbiA+PiB4OwogICAgICAgIHNvcnQoYS5iZWdpbigpLCBhLmVuZCgpKTsKICAgICAgICBpbnQgYmVzdCA9IG4tMTsgIAogICAgICAgIGZvciAoaW50IHAgPSAwOyBwIDwgMjsgKytwKSB7CiAgICAgICAgICAgIGludCBsID0gLTEsIHIgPSAtMTsKICAgICAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyArK2kpIHsKICAgICAgICAgICAgICAgIGlmICgoYVtpXSAmIDEpID09IHApIHsKICAgICAgICAgICAgICAgICAgICBpZiAobCA9PSAtMSkgbCA9IGk7CiAgICAgICAgICAgICAgICAgICAgciA9IGk7CiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgIH0KICAgICAgICAgICAgaWYgKGwgIT0gLTEpIHsKICAgICAgICAgICAgICAgIGludCBjb25kID0gbCArIChuIC0gMSAtIHIpOwogICAgICAgICAgICAgICAgYmVzdCA9IG1pbihiZXN0LCBjb25kKTsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICBjb3V0IDw8IGJlc3QgPDwgIlxuIjsKfQoKaW50IG1haW4oKXsgCiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKG51bGxwdHIpOwoJCiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgc29sdmUoKTsKICAgIAoKICAgIHJldHVybiAwOwp9Cg==