#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main() {
  int n;
  cin >> n;
  vector v(26, vector<pair<int, int>>());
  vector<int> add(26, 0);
  rep(i, n) {
    string s;
    cin >> s;
    bool f = false;
    rep(j, s.size()-1) {
      if(s.at(j) > s.at(j+1)) {
        f = true;
        break;
      }
    }
    if(f) continue;
    if(s.front() == s.back()) add.at(s.front() - 'a') += s.size();
    else v.at(s.front() - 'a').push_back({s.back() - 'a', s.size()});
  }
  vector<int> dp(26, 0);
  int ans = 0;
  rep(i, 26) {
    int now = dp.at(i);
    ans = max(ans, now);
    ans += add.at(i);
    for(auto [nx, co] : v.at(i)) {
      dp.at(nx) = max(dp.at(nx), ans + co);
    }
    // if(i < 10) cerr << ans << endl;
  }
  cout << ans << endl;
  return 0;
}