#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
int dp[26];
int main()
{
    int n; cin>>n;
    for(int i=0; i<n; i++){
        string s; cin>>s;
        int m=s.size();
        bool dame=0;
        for(int j=0; j<m-1; j++){
            if(s[j]>s[j+1]){
                dame=1;break;
            }
        }
        if(dame) continue;
        int mx=*max_element(dp, dp+(s[0]-'a')+1);
        dp[s.back()-'a']=max(dp[s.back()-'a'], mx+m);
    }
    cout<<*max_element(dp, dp+26)<<endl;
    return 0;
}