#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<vector<pair<int, int>>> E(26);
  for (int i = 0; i < N; i++){
    string S;
    cin >> S;
    int L = S.size();
    bool ok = true;
    for (int j = 0; j < L - 1; j++){
      if (S[j] > S[j + 1]){
        ok = false;
      }
    }
    if (ok){
      int u = S[0] - 'a';
      int v = S[L - 1] - 'a';
      E[u].push_back(make_pair(v, L));
    }
  }
  for (int i = 0; i < 26; i++){
    sort(E[i].begin(), E[i].end());
  }
  vector<int> dp(26, 0);
  for (int i = 0; i < 26; i++){
    if (i > 0){
      dp[i] = max(dp[i], dp[i - 1]);
    }
    for (auto P : E[i]){
      int v = P.first;
      dp[v] = max(dp[v], dp[i] + P.second);
    }
  }
  int ans = 0;
  for (int i = 0; i < 26; i++){
    ans = max(ans, dp[i]);
  }
  cout << ans << endl;
}