#include <bits/stdc++.h>
using namespace std;
long long POS(long long x) {
  if (x > 0)
    return x;
  else
    return 0;
}
struct ysh {
  long double z, y, x;
  ysh() {}
  ysh(long double z, long double y, long double x) : z(z), y(y), x(x) {}
  ysh operator+(const ysh &p) const { return ysh(z + p.z, y + p.y, x + p.x); }
  ysh operator-(const ysh &p) const { return ysh(z - p.z, y - p.y, x - p.x); }
  ysh operator*(long double con) const {
    return ysh(z * con, y * con, x * con);
  }
  ysh operator/(long double con) const {
    return ysh(z / con, y / con, x / con);
  }
  bool operator<(const ysh &rhs) const {
    return make_pair(z, make_pair(y, x)) <
           make_pair(rhs.z, make_pair(rhs.y, rhs.x));
  }
  bool operator==(const ysh &rhs) const {
    return make_pair(z, make_pair(y, x)) ==
           make_pair(rhs.z, make_pair(rhs.y, rhs.x));
  }
};
struct node {
  char end;
  int val;
};
long long arr[100][100] = {0};
long long l;
inline void find(int x, int y) {
  long long ans;
  for (int j = (0); j < (26); ++j) {
    if (arr[j][x] > 0) {
      arr[j][y] = max(arr[j][y], arr[j][x] + l);
    }
  }
  arr[x][y] = max(arr[x][y], l);
}
int main() {
  long long n, m;
  cin >> n;
  int x, y;
  string s;
  for (int i = (0); i < (n); ++i) {
    cin >> s;
    l = s.size();
    x = s[0] - 'a';
    y = s[l - 1] - 'a';
    find(x, y);
  }
  long long ans = 0;
  for (int i = (0); i < (26); ++i) {
    ans = max(ans, arr[i][i]);
  }
  cout << ans << endl;
  return 0;
}
