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

int main() {
    int N;
    cin >> N;
    vector<string>S(N);
    vector<vector<int>>dist(26,vector<int>(26));
    for(int i = 0; i < N; i++) {
        cin >> S[i];
        string T = S[i];
        sort(T.begin(),T.end());
        if(S[i] == T) {
            if(S[i][0] == S[i].back()) {
                dist[S[i][0]-'a'][S[i][0]-'a'] += S[i].size();
            }
            else {
                dist[S[i][0]-'a'][S[i].back()-'a'] = max(dist[S[i][0]-'a'][S[i].back()-'a'],(int)S[i].size());
            }
        }
    }
    vector<int>dp(26);
    for(int i = 0; i < 26; i++) {
        dp[i] += dist[i][i];
        int mx = 0;
        for(int j = i+1; j < 26; j++) {
            mx = max(mx,dist[i][j]);
            dp[j] = max(dp[j],dp[i]+mx);
        }
    }
    int ans = 0;
    for(int i = 0; i < 26; i++) {
        ans = max(ans,dp[i]);
    }
    cout << ans << endl;
}