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

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;
  auto ss=read<string>(n);

  using T = tuple<int, int, int>;
  vector<T> vt;
  for(auto s:ss){
    if(not is_sorted(s.begin(),s.end())) continue;
    vt.emplace_back(s.back()-'a',s.front()-'a',s.size());
  }
  sort(vt.begin(),vt.end());
  const int MAX = 26;
  vector<int> dp(MAX,0);
  for(auto[r,l,t]:vt)
    for(int k=l;k>=0;k--)
      chmax(dp[r],dp[k]+t);

  cout<<*max_element(dp.begin(),dp.end())<<newl;
  return 0;
}