#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  int N; cin >> N;
  vector<vector<int>> tmp(26, vector<int>(26));
  for (int i = 0; i < N; i++) {
    string S; cin >> S;
    int len = S.size();
    string T = S;
    sort(T.begin(), T.end());
    if (S == T) {
      int l = S.front() - 'a';
      int r = S.back() - 'a';
      if (l == r) {
        tmp[l][r] += len;
      } else {
        tmp[l][r] = max(tmp[l][r], len);
      }
    }
  }
  vector<int> dp(26);
  for (int i = 0; i < 26; i++) {
    dp[i] = dp[i] + tmp[i][i];
    for (int j = i + 1; j < 26; j++) {
      dp[j] = max(dp[j], dp[i] + tmp[i][j]);
    }
  }
  cout << dp[25] << endl;
  return 0;
}