/*
TASK:family
LANG:C++
*/
#include<string>
#include<iostream>
using namespace std;
bool is_family(string a, string b)
{
     int i,j,br=0,izp[30]={0};
     bool fl;
     if (a.size()!=b.size()) return false;
     for (i=0;i<a.size();i++) {
         fl=false;
         for (j=0;j<b.size();j++) if (a[i]==b[j]&&!izp[j]) {
             fl=true;
             izp[j]=1;
             }
         if (fl) br++;
         }
     if (br+1>=b.size()) return true;
     return false;
     }

int main() 
{
    int n,br[30][30]={0},i,j,max=0,brmax=0;
    string duma[1000];    
    cin >> n;
    for (i=0;i<n;i++) {
        cin >> duma[i];
        for (j=i-1;j>=0;j--) 
            if (duma[i].size()==duma[j].size()&&
               is_family(duma[i],duma[j])) 
               br[i][j]=br[j][i]=1;
               }
        for (i=0;i<n;i++) {
            brmax=0;
            for (j=0;j<n;j++) if (br[i][j]) brmax++;
            if (brmax>max) max=brmax;
            }
        cout << max+1 << "\n";
        return 0;
        }
               
        
