#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

void chmax(int &a, int b) {
  a = max(a,b);
}

int main() {
  int n;
  cin >> n;
  vector<string> s(n);
  rep(i,n) cin >> s[i];
  int edge[26][26] = {0};

  rep(i,n) {
    bool flag = true;
    rep(j, s[i].size()-1) {
      if (s[i][j] > s[i][j+1]) flag = false;
    }
    if (flag) {
      int from = s[i][0]-'a'; 
      int to = s[i].back()-'a';
      chmax(edge[from][to], s[i].size());
    }
  }

  int dp[26] = {0};
  rep(i, 26) {
    rep(j,26) {
      chmax(dp[j], dp[i]+edge[i][j]); 
    }
  }
  int ans = 0;
  rep(i,26) chmax(ans, dp[i]);
  cout << ans << endl;




}