#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N; cin >> N;
    vector<vector<int>> A(26, vector<int>(26, 0));
    rep(_,N) {
        string s; cin >> s;
        int n = int(s.size());
        int ok = 1;
        rep(i,n-1) ok &= (s[i] <= s[i + 1]);
        if(ok) A[s[0] - 'a'][s[n - 1] - 'a'] += n;
    }

    vector<int> dp(26, 0);
    rep(i,26) {
        rep(j,i) dp[i] = max(dp[i], dp[j] + A[j][i]);
        dp[i] += A[i][i];
    }
    cout << dp.back() << endl;
}