#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int dp[26][1000006];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector < pair<pair<int, int>, int> > l;
	rep(i, n) {
		string s; cin >> s;
		bool b = true;
		rep(j, s.size() - 1) {
			if (s[j] > s[j + 1])b = false;
		}
		if (b)l.push_back({ {s[0] - 'a',s[s.size() - 1] - 'a'},(int)s.size() });
	}
	sort(all(l));
	rep(i, l.size()) {
		rep(j, 26) {
			chmax(dp[i + 1][j], dp[i][j]);
			rep(k, l[i].first.first + 1) {
				chmax(dp[i + 1][l[i].first.second], dp[i][k] + l[i].second);
			}
		}
	}
	int ans = 0;
	rep(i, 26) chmax(ans, dp[l.size()][i]);
	return 0;
}