#include<bits/stdc++.h>
using namespace::std;

const int inf = 1000000000 + 10;
const int N = 200000 + 5;
const int E = 26;

int n;
int L[N];
int R[N];
int len[N];
int maxi[E];
int memo[N];
bool valid[N];

bool check(string &s){
	for(int i = 1; i < s.size(); i++){
		if(s[i - 1] > s[i]) return false;
	}
	return true;
}

int main(){
	cin >> n;
	for(int i = 0; i < n; i++){
		string s;
		cin >> s;
		L[i] = s[0] - 'a';
		R[i] = s[s.size() - 1] - 'a';
		len[i] = s.size();
		valid[i] = check(s);
	}
	for(int i = 0; i < E; i++) maxi[i] = -inf;
	memo[0] = valid[0] ? len[0] : -inf;
	if(valid[0]) maxi[R[0]] = len[0];
	for(int i = 1; i < n; i++){
		if(valid[i]){
			int best = len[i];
			for(int j = 0; j <= L[i]; j++){
				best = max(best, len[i] + maxi[j]);
			}
			memo[i] = best;
			maxi[R[i]] = max(maxi[R[i]], best);
		}
		else memo[i] = -inf;
	}
	printf("%d\n", max(0, *max_element(maxi, maxi + E)));
	return 0;
}