#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    assert(N <= 200000);
    vector<vector<int>> dist(26,vector<int>(26));
    int sum = 0;
    for (int i = 0; i < N; i++) {
        string S;
        cin >> S;
        int K = (int)S.size();
        assert(K <= 200000);
        sum += K;
        for (int j = 0; j < K; j++) {
            assert('a' <= S[j] && S[j] <= 'z');
        }
        string T = S;
        sort(T.begin(),T.end());
        if (S == T) {
            int l = S.front()-'a';
            int r = S.back()-'a';
            if (l == r) {
                dist[l][r] += K;
            }
            else {
                dist[l][r] = max(dist[l][r],K);
            }
        }
    }
    assert(sum <= 200000);
    vector<int> dp(26);
    for (int i = 0; i < 26; i++) {
        dp[i] = dp[i]+dist[i][i];
        for (int j = 0; j < i; j++) {
            dp[i] = max(dp[i],dp[j]);
        }
        for (int j = i+1; j < 26; j++) {
            dp[j] = max(dp[j],dp[i]+dist[i][j]);
        }
    }
    cout << dp[25] << endl;
}