https://codeforc.es/contest/1251/problem/B
#include <bits/stdc++.h>
#include <unordered_map>
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int N=1e5+9;
int a[N];
int main()
{
FAST_IO;
int T;
cin>>T;
while(T--)
{
int n;
cin>>n;
int yi=0,ling=0,ou=0,ji=0;
int ans=n;
for(int i=0;i<n;i++)
{
string s;
cin>>s;
a[i]=s.length();
for(int j=0;j<a[i];j++)
{
if(s[j]=='1') yi++;
else ling++;
}
if(a[i]%2==0) ou++;
else ji++;
}
if(ji==0)
{
if(ling %2==1||yi%2==1) ans--;
}
cout<<ans<<endl;
}
return 0;
}