#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;cin >> n;
    vector<vector<int>> d(26,vector<int>(26));
    vector<int> c(26);
    REP(i,n){
        string s;cin >> s;
        string u=s;
        sort(ALL(u));
        int t=s.size();
        if(u==s){
            if(s[0]==s[t-1]) c[s[0]-'a']+=t;
            else{
                int a=s[0]-'a',b=s[t-1]-'a';
                chmax(d[a][b],t);
            }
        }
    }
    vector<int> dp(26);
    REP(i,26){
        dp[i]+=c[i];
        FOR(j,i+1,26) chmax(dp[j],dp[i]+d[i][j]);
    }
    cout << dp[25] << endl;
}