#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int n;
    cin >> n;
    vector<vector<pair<int, int>>> dat(26);
    for(int i = 0; i < n; ++i){
        string s;
        cin >> s;
        bool ok = true;
        for(int j = 0; j + 1 < (int)s.length(); ++j){
            if(s[j] > s[j + 1]) ok = false;
        }
        if(ok)  dat[s[0] - 'a'].emplace_back(s.back() - 'a', s.length());
    }

    vector<int> dp(26);
    for(int i = 0; i < 26; ++i){
        sort(begin(dat[i]), end(dat[i]));
        for(auto& [ni, len] : dat[i]){
            auto dp2 = dp;
            for(int j = 0; j <= i; ++j){
                chmax(dp2[ni], dp[j] + len);
            }
            swap(dp, dp2);
        }
    }
    
    cout << *max_element(begin(dp), end(dp)) << endl;

    return 0;
}