#include <bits/stdc++.h>

using namespace std;
using ll = long long;

bool check(string &s){
    int N=s.size();
    for (int i=0; i<N-1; i++) if (s[i] > s[i+1]) return 0;
    return 1;
}

int main(){

    int N, a, b, c, ans=0;
    cin >> N;
    string T;
    vector<tuple<int, int, int>> S;
    for (int i=0; i<N; i++){
        cin >> T;
        if (check(T)){
            S.push_back({T.back()-'a', T[0]-'a', (int)T.size()});
        }
    }

    N = S.size();
    sort(S.begin(), S.end());
    vector<int> dp(26);
    for (int i=0; i<N; i++){
        tie(b, a, c) = S[i];
        ans = 0;
        for (int j=0; j<=a; j++) ans = max(ans, dp[j]);
        dp[b] = max({dp[b], ans+c});
    }

    for (int i=0; i<26; i++) ans = max(ans, dp[i]);
    cout << ans << endl;

    return 0;
}