#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int n,maxnum,a[100];

void dfs(int getnum,int now,int deep)
{
	if (deep==n)
	{
		if (now==0)
			if (maxnum<getnum)
				maxnum=getnum;
		return;
	}
	dfs(getnum+1,now^a[deep+1],deep+1);
	dfs(getnum,now,deep+1);
}

int main(void)
{
	freopen("necklaced.in","r",stdin);
	freopen("necklaced.out","w",stdout);
	int i,j,len;
	char ch[100];
	cin>>n;
	for (i=1;i<=n;i++)
	{
		cin>>ch;
		len=strlen(ch);
		for (j=0;j<len;j++)
			a[i]+=(1<<ch[j]-'A');
	}
	dfs(1,a[1],1);
	dfs(0,0,1);
	cout<<maxnum<<endl;
	return(0);
}