#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
struct node {
bool mark;
int chain, ans;
node * p[26];
node(){
chain = 0;
mark = 0;
ans = 0;
for(int i = 0; i < 26; i++)
p[i] = NULL;
}
};
typedef node * pn;
pn root = new node;
void add(string & s){
reverse(s.begin(), s.end());
pn cur = root;
for(char c: s){
if(cur->p[c - 'a'] == NULL){
cur->p[c - 'a'] = new node;
}
cur = cur->p[c - 'a'];
}
cur->mark = 1;
}
void dp(pn cur){
for(int i = 0; i < 26; i++){
if(cur->p[i] != NULL){
dp(cur->p[i]);
cur->chain += cur->p[i]->chain;
cur->ans = max(cur->ans, cur->p[i]->ans);
}
}
cur->ans = max(cur->ans, cur->chain);
if(!cur->mark)
cur->chain = 0;
else
cur->chain++;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
cin>>n;
for(int i = 0; i < n; i++){
string s;
cin>>s;
add(s);
}
dp(root);
cout<<root->ans<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
