#include <bits/stdc++.h> using namespace std; void solve() { int n; cin>>n; assert(2<=n && n <=10000); vector<int> arr(n); for(int i = 0; i < n; ++i) { cin>>arr[i]; assert(1<=arr[i] && arr[i]<=1000000000); arr[i]=arr[i]%2; } vector<int> a(n+1); vector<int> b(n+1); for(int i = 1; i < n; ++i) { a[i] = a[i-1]; if(arr[i]==arr[0]) { a[i]++; } } for(int i = n-1; i >= 0; --i) { b[i] = b[i+1]; if(arr[i] == arr[n-1]) { b[i]++; } } int ans = 1e9; for(int i = 0; i < n; ++i) { if(arr[i] == arr[0]) ans = min(ans, a[i]+b[i+1]); } cout<<ans<<endl; } int main() { int t; cin>>t; assert(1<=t&&t<=100); while(t--) { solve(); } }