#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N; cin >> N;

    vector<string> S(N);
    rep(i, N) cin >> S[i];

    vector<vector<pii>> ps(26);
    rep(i, N){
        bool flag = true;
        int s = S[i].front()-'a';
        int t = S[i].back()-'a';
        int l = sz(S[i]);

        rep(j, l-1){
            if(S[i][j] > S[i][j+1]) flag = false;
        }

        if(flag) ps[s].eb(t, l);
    }

    rep(i, 26){
        sort(all(ps[i]));
    }

    vector<int> dp(26, 0);
    rep(i, 26){
        if(i > 0) chmax(dp[i], dp[i-1]);
        each(e, ps[i]){
            chmax(dp[e.first], dp[i]+e.second);
        }
    }

    cout << dp[25] << '\n';
}