#include<bits/stdc++.h>
#include<iostream>
using namespace std;
using LL = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const int INF = 1 << 29;
const long long LINF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define rep(i,n) for(int i = 0; i < (n); ++i)
template<class T>void chmin(T&a, T b){if(a > b) a = b;}
template<class T>void chmax(T&a, T b){if(a < b) a = b;}


int main(){
	LL N; cin >> N;
	vector<vector<int>> tmp(26, vector<int>(26, 0));
	for(LL i = 0; i < N; ++i){ 
		string S, T; cin >> S;
		T = S;
		sort(S.begin(), S.end());
		if(T!=S) continue;
		int a = S[0] - 'a', b = S[(int)S.size()-1] - 'a';
		tmp[a][b] = max(tmp[a][b], (int)S.size());
	}
	/*
	for(int i = 0; i < 26; ++i){
		for(int j = 0; j < 26; ++j){
			cout << tmp[i][j] << " ";
		}
		cout << endl;
	}
	*/
	vector<long long> dp(26, 0);
	dp[0] = 0;
	for(int i = 0; i < 26; ++i){
		for(int j = 0; j < 26; ++j){
			if(j<i) continue;
			chmax(dp[j], dp[i] + tmp[i][j]);
		}
	}
	LL ans = 0;
	for(int i = 0; i < 26; ++i){
		//cout << dp[i] << endl;
		ans = max(ans, dp[i]);
	}
	cout << ans << endl;


}