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

typedef long long ll;

int main() {
    int N;
    scanf("%d", &N);
    string S;
    vector<vector<int>> ESL;
    rep(i, N) {
        cin >> S;
        int l = S.size();
        bool f = false;
        rep(j, l - 1) {
            if (S[j] > S[j + 1]) f = true;
        }
        if (f) continue;
        ESL.push_back({S[l - 1] - 'a', S[0] - 'a', l});
        //cout << S[l - 1] << " " << S[0] << " " << l << endl;
    }
    sort(ESL.begin(), ESL.end());
    int M = ESL.size();
    vector<vector<int>> dp(M + 1, vector<int>(26, 0));
    rep(i, M) {
        rep(j, 26) {
            dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
            if (j <= ESL[i][1]) dp[i + 1][ESL[i][0]] = max(dp[i + 1][ESL[i][0]], dp[i][j] + ESL[i][2]);
        }
    }
    int ans = 0;
    rep(i, 26) ans = max(ans, dp[M][i]);
    printf("%d\n", ans);
    /*
    rep(i, M + 1) {
        rep(j, 26) {
            cout << dp[i][j] << " ";
        }
        cout << endl;
    }
    */
}