#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
using namespace std;
int n;
string s;
int f[30];
int maxn;
void dfs(int x,int s,int k){
	if (x>n && s==0){
		if (k>maxn) maxn=k;}else{
			if (x<=n){
				dfs(x+1,s^f[x],k+1);
				dfs(x+1,s,k);
			}
		}
}
int main()
{
	freopen("necklaced.in","r",stdin);
	freopen("necklaced.out","w",stdout);
	memset(f,0,sizeof(f));
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>s;
		int l=s.size();
		for (int j=0;j<l;j++){
			int tmp=s[j]-'A';
			tmp=1<<tmp;
			f[i]=f[i]+tmp;
		}
	}
	maxn=0;
	dfs(1,0,0);
	cout<<maxn;
	return 0;
}