#include <bits/stdc++.h>
using namespace std;
long long dp[30];
int main() {
  int n;
  cin >> n;
  vector<string> S;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    string t = s;
    sort(t.begin() , t.end());
    if (s == t) S.push_back(s);
  }
  sort(S.begin() , S.end());
  n = S.size();
  for (int i = 0; i < n; i++) {
    int pre = S[i][0] - 'a';
    int now = S[i].back() - 'a';
    long long mx = dp[now];
    for (int j = 0; j <= pre; j++) {
      mx = max(mx , dp[j] + (long long)S[i].size());
    }
    dp[now] = mx;
  }
  long long ans = 0;
  for (int i = 0; i < 26; i++) {
    ans = max(ans , dp[i]);
  }
  cout << ans << endl;
  return 0;
}