#include <bits/stdc++.h>
using namespace std;
 
int main(){
    int n, a[26] = {}, b, k = 0, d;
    cin >> n;
    string s;
    vector<string> v;
    for(int i = 0; i < n; i++){
        cin >> s;
        b = 1;
        for(int j = 1; j < s.size(); j++){
            if(s[j] < s[j - 1]) b = 0;
        }
        if(b) v.push_back(s);
    }
    sort(v.begin(), v.end());
    for(int i = 0; i < v.size(); i++){
        d = v[i].size();
        a[v[i][v[i].size() - 1] - 'a'] = max(a[v[i][v[i].size() - 1] - 'a'], a[v[i][0] - 'a'] + d);
        k = max(k, a[v[i][v[i].size() - 1] - 'a']);
        for(int j = 1; j < 26; j++) a[j] = max(a[j], a[j - 1]);
    }
    cout << k << endl;
}