#include<cstdio>  
#include<cstring>  
using namespace std;  
int tot;  
struct node
{  
    int next[26];  
    int f;  
    node (){memset(next,-1,sizeof(next));f=-1;}  
}T[10000*50];  
char str[110];  
int ans;  
void insert()
{  
    int root=0; int t=0;  
    for(int i=0;str[i];i++)
	{  
        if(T[root].next[ str[i]-'a' ]==-1)  T[root].next[ str[i]-'a' ]=tot++;  
        root=T[root].next[ str[i]-'a' ];  
        if(T[root].f!=-1)
		{  
           t++;  
        }  
    }  
    T[root].f=t+1;  
    if(t+1>ans) ans=t+1;  
}  
int main()
{  
    freopen("link.in","r",stdin);  
    freopen("link.out","w",stdout);  
    int n; tot=1; ans=1;  
    scanf("%d",&n);  
    for(int i=0;i<n;i++)
	{  
        scanf("%s",str);  
        insert();  
    }  
    printf("%d\n",ans);  
    return 0;  
}