#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18 + 1;
const double pi = acos(-1);

using Graph = vector < vector <ll >>;

//typedef atcoder::modint1000000007 mint;
//typedef atcoder::modint998244353 mint;
//typedef modint mint_b;

ll dp[200010][30];

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

    int n; cin >> n;
    vector<string> a;
    rep(i, n) {
        string s; cin >> s;
        bool ok = true;
        rep(j, SZ(s) - 1) {
            if (s[j] > s[j + 1]) ok = false;
        }

        if (!ok) continue;
        a.push_back(s);
    }

    sort(all(a));

    int m = SZ(a);
    rep(i, m) {
        int st = a[i][0] - 'a' + 1;
        int en = a[i][SZ(a[i]) - 1] - 'a' + 1;
        int len = SZ(a[i]);

        rep(j, 27) {
            if (j <= st) {
                dp[i + 1][en] = max(dp[i + 1][en], dp[i][j] + len);
            }
            dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
            if (j > 0) dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - 1]);
        }
    }

    cout << dp[m][26] << endl;


}