import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum A = 26;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto S = new string[N];
      foreach (i; 0 .. N) {
        S[i] = readToken();
      }
      
      auto P = new int[A];
      auto Q = new int[][](A, A);
      foreach (i; 0 .. N) {
        const len = cast(int)(S[i].length);
        bool ok = true;
        foreach (j; 0 .. len - 1) {
          ok = ok && (S[i][j] <= S[i][j + 1]);
        }
        if (ok) {
          const u = S[i][0] - 'a';
          const v = S[i][len - 1] - 'a';
          if (u == v) {
            P[u] += len;
          } else {
            chmax(Q[u][v], len);
          }
        }
      }
      
      auto dp = P.dup;
      foreach (u; 0 .. A) foreach (v; u + 1 .. A) {
        chmax(dp[v], dp[u] + Q[u][v] + P[v]);
      }
      const ans = dp.maxElement;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}