#include <iostream>
#include <vector>
#include <string>

using namespace std;
constexpr int K = 26;

void solve() {
    int n;
    cin >> n;

    vector<vector<pair<int, int>>> graph(K);
    vector<int> lens(K, 0);

    while (n--) {
        string s;
        cin >> s;
        int m = s.length();

        bool judge = true;
        for (int i = 0; i + 1 < m; ++i) {
            if (s[i] > s[i + 1]) judge = false;
        }

        if (judge) {
            int i = s.front() - 'a',
                j = s.back() - 'a';

            if (i == j) {
                lens[i] += m;
            } else {
                graph[i].emplace_back(j, m);
            }
        }
    }

    vector<int> dp(K + 1, 0);
    for (int i = 0; i < 26; ++i) {
        dp[i] += lens[i];
        for (auto [j, m] : graph[i]) {
            dp[j] = max(dp[j], dp[i] + m);
        }
        dp[i + 1] = max(dp[i + 1], dp[i]);
    }

    cout << dp[K] << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}