#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
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; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<vector<string>> S(26);
	vector<int> base(26);
	REP(i, N) {
		string s;
		cin >> s;
		bool sorted = true;
		FOR(j, 1, s.size()) sorted &= s[j - 1] <= s[j];
		if (sorted) {
			const char c = s.front() - 'a';
			if (s.front() == s.back()) base[c] += s.size();
			else S[c].emplace_back(s);
		}
	}
	
	vector<int> dp(27, 0);
	REP(i, 26) {
		dp[i] += base[i];
		chmax(dp[i + 1], dp[i]);
		for (auto & s : S[i]) chmax(dp[s.back() - 'a'], dp[i] + s.size());
	}
	cout << dp[26] << endl;
}