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

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