#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
void Sieve(long long n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
long long fast_pow(int x, unsigned int y, int p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = 1ll * (res * x) % p;
    y = y >> 1;
    x = (1ll * x * x) % p;
  }
  return res;
}
struct name {
  int a, b, w;
};
name arr[500005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    arr[i].a = s[0] - 'a', arr[i].b = s[s.length() - 1] - 'a',
    arr[i].w = s.length();
  }
  int ans = 0;
  for (int i = 0; i < 26; i++) {
    vector<int> v(26, INT_MIN);
    v[i] = 0;
    for (int j = 0; j < n; j++) {
      int a = arr[j].a, b = arr[j].b, w = arr[j].w;
      if (v[a] >= 0) v[b] = max(v[b], v[a] + w);
    }
    ans = max(ans, v[i]);
  }
  cout << ans;
  return 0;
}
