#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

void Main() {
  ll n;
  cin >> n;
  string s[n];
  rep(i,n) cin >> s[i];
  ll d[26][26];
  mem(d);
  rep(i,n) {
    string t=s[i];
    sort(all(t));
    if(t!=s[i]) continue;
    ll x=s[i][0]-'a',y=s[i].back()-'a';
    if(x!=y) d[x][y]=max(d[x][y],(ll)s[i].size());
    else d[x][y]+=s[i].size();
  }
  ll dp[26];
  mem(dp);
  rep(i,26) {
    REP(j,i,26) {
      dp[j]=max(dp[j],dp[i]+d[i][j]);
    }
  }
  ll ans=0;
  rep(i,26) ans=max(ans,dp[i]);
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}