#include<bits/stdc++.h>
    #define int long long
    #define re register
    #define il inline
	#define inf 1e18
    #define eps 1e-15
    #define ll long long
    #define mod 998244353
    #define bianli for(int i=head[x];i;i=a[i].next)
    #define QWQ cout<<"qwq";
    #define me(qw) memset(qw,0,sizeof(qw));
    #define meinf(qw) memset(qw,0x3f,sizeof(qw));
    using namespace std;
	const int maxn=5e4+5;
	string ss[maxn];
	int ch[maxn][26],val[maxn],cnt,ans;
	void insert(string s){
	int len=s.length(),x=0;
	for(int i=0;i<len;i++){
	int qwq=s[i]-'a';
	if(!ch[x][qwq]) ch[x][qwq]=++cnt;	
	x=ch[x][qwq];}
	val[x]++;}
	
	void ask(string s){
	int x=0,len=s.length(),sum=0;
	for(int i=0;i<len;i++){
	int qwq=s[i]-'a';
	x=ch[x][qwq];
	if(val[x])sum+=val[x];
	}
	ans=max(ans,sum);
	}
	int n;
  	signed main(){
	freopen("link.in", "r", stdin);
    freopen("link.out", "w", stdout);
	cin>>n;
	for(int i=1;i<=n;i++){
	cin>>ss[i];
	insert(ss[i]);}
	for(int i=1;i<=n;i++)ask(ss[i]);
	cout<<ans;
   	return 0;
}