#include <bits/stdc++.h>
#include <atcoder/all>

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007LL;//998244353LL;
static const LLONG INF_NUM = MOD_NUM * 20LL;
template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}
template <class _T> static _T tp_pow(int x, int exp)
{
	_T ans = 1;
	_T base = x;
	while (exp > 0) {
		if (exp & 1) {
			ans = (ans * base);
		}
		base = (base * base);
		exp >>= 1;
	}
	return ans;
}

static void task();

int main()
{
	task();
	fflush(stdout);
	return 0;
}

static void task()
{
	int N;
	get(N);

	std::vector<std::pair<int, int>> code(N, std::pair<int, int>{MOD_NUM, MOD_NUM});
	std::vector<std::string> si(N);
	for (int i = 0; i < N; i++) {
		get(si[i]);

		bool asc = true;
		int len = si[i].length();
		int first = si[i][0], end = si[i][len - 1];
		for (int j = 1; j < len; j++) {
			if (si[i][j] < si[i][j - 1]) {
				asc = false;
				break;
			}
		}

		if (asc) {
			code[i].first = first - 'a' + 1;
			code[i].second = end - 'a' + 1;
		}
	}
	std::vector<std::vector<int>> dp(N + 1, std::vector<int>(27, 0));
	for (int c = 0; c < 26; c++) {
		for (int i = 0; i < N; i++) {
			dp[i + 1][c + 1] = std::max({ dp[i][c], dp[i][c + 1], dp[i + 1][c] });
			if (code[i].second == c + 1) {
				if (dp[i + 1][c + 1] < dp[i][code[i].first] + si[i].length()) {
					dp[i + 1][c + 1] = dp[i][code[i].first] + si[i].length();
				}
			}
		}
	}
	printf("%d\n", dp[N][26]);
}