/*
TASK:family
LANG:C++
*/
#include<iostream>
using namespace std;
const int MAXN=1005;
const int MAXL=30;
int w[MAXN][MAXL];
int fam[MAXN];
int relative(int a,int b){
  int ofl=1,mofl=1,i,mab;
  for(i=0;i<MAXL;i++){
  mab=w[a][i]-w[b][i];
  if(-1>mab||1<mab) return 0;
  if((mab==1)&&ofl){ofl=0; continue;}
  if((mab==-1)&&mofl){mofl=0; continue;}
  if(mab==0) continue;
  return 0;
  }
  return 1;    
}
int main(){
    int n,i,j,k,fams,min,res=0,tmp;
    char ch;
    //empty 
    for(i=0;i<MAXN;i++)
    for(j=0;j<MAXL;j++)
    w[i][j]=0;
    cin>>n;
    ch=cin.get();
    for(i=0;i<n;i++){
      ch=cin.get();
      while(ch!='\n'){
        w[i][ch-'A']++;
        ch=cin.get();
      }             
    }
    //empty the family list
    for(i=0;i<n;i++) fam[i]=0;
    fams=0;//temp # of families
    for(i=0;i<n-1;i++){
      //for every word
      if(fam[i]==0){
        fams++;
        fam[i]=fams;
        for(j=i+1;j<n;j++){
          if(relative(i,j)){
            if(fam[j]==0){fam[j]=fams;}else{
              //finding min
              min=fam[i];
              if(min>fam[j]) min=fam[j];
              for(k=0;k<n;k++)
              if(fam[k]==fam[i]||fam[k]==fam[j]) fam[k]=min;
            }                
          }
        }          
      }else{
        for(j=i+1;j<n;j++){
          if(relative(i,j)){
            if(fam[j]==0){fam[j]=fam[i];}else{
              min=fam[i];
              if(min>fam[j]) min=fam[j];
              for(k=0;k<n;k++)
              if(fam[k]==fam[i]||fam[k]==fam[j]) fam[k]=min;                                  
            }                  
          }                   
        }
      }
    }
    //result
    for(i=1;i<fams;i++){
      //for all farms
      tmp=0;
      for(j=0;j<n;j++) if(fam[j]==i) tmp++;
      if(tmp>res) res=tmp;                
    }
    //test
    //for(i=0;i<n;i++) cout<<fam[i]<<' ';
    cout<<res<<endl;
    //for(i=0;i<n;i++){
    //for(j=0;j<MAXL;j++) cout<<w[i][j]<<' ';
    //cout<<endl;                 
    //}
    //cout<<relative(0,1)<<endl;
    cin>>ch;
    return 0;
    }
