10
abdcced
bdacdac
ecb
dc
eaeeebdd
adcdbadcac
eb
aadecccde
edbaeacad
accd
 100
d
a
e
eb
c
d
d
e
c
e
ac
d
c
aa
a
e
da
e
e
c
e
a
c
c
bc
bd
d
da
cc
be
b
a
ee
d
be
be
e
b
a
ed
cb
ab
a
ea
ac
aa
ed
d
b
eb
e
ed
c
ce
c
d
c
d
d
ee
e
b
ea
ea
da
ab
ba
ed
da
ec
ea
bd
ee
dc
d
bd
d
c
cc
ab
bd
a
ad
e
d
e
bc
bb
c
bc
a
a
e
ca
ac
c
ad
c
be
d
 3
ab
acb
ba
 10
a
b
a
c
b
a
b
a
a
a
 5
cab
bbc
caa
ccc
aca
 3
ac
abc
ca
 5
ab
bc
cd
de
ffffffffff
 16
ddgcb
fgbhgbdg
gha
dh
ddfb
fggbc
edb
hd
d
hfgcabf
hdaef
fhbcdgba
chee
cafeggc
f
ecb
 50
agecd
cghafi
fiide
iecc
jbdcfjhgd
diee
hfeg
ehc
gfijgjh
gacaifebg
dicbbddc
hjgciaei
jjcdh
g
gc
cf
hfdjhd
c
icidbec
ji
eeh
cgeejggc
acfd
jjg
ajefdj
eghhebiic
bih
gbb
jjaa
idc
gafi
ecg
dbigbjiehj
cedif
ahidfaaajg
hfhhiccbgb
dgegjgieif
hgjebhfdc
j
ahehd
ahdah
bijbhh
a
dabiggfhac
dedigbjbf
ihbdj
iihagchd
gfebhfdi
jbjdcggdh
f

0
 35
 5
 6
 9
 5
 10
 7
 37

#include <bits/stdc++.h>
using namespace std;
inline void file() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  if (0) {
    freopen(".in", "r", stdin);
    freopen(".out", "w", stdout);
  }
}
inline void read(int& n) {
  char h;
  n = 0;
  for (h = getchar(); h < '0' || h > '9'; h = getchar())
    ;
  for (; h >= '0' && h <= '9'; h = getchar()) n = n * 10 + h - '0';
}
const clock_t MAXT = (100 * CLOCKS_PER_SEC) / 1000;
const int PX[8] = {1, 0, -1, 0, 1, 1, -1, -1},
          PY[8] = {0, 1, 0, -1, -1, 1, 1, -1}, N = 26, INF = 1e9, MOD = 1e9 + 7;
const long long INFL = 1e18, MODL = 1e9 + 7;
const long double EPS = 1e-6;
inline int rnd(int l = 0, int r = INF) {
  unsigned ans = rand();
  ans = (ans << 8) ^ rand();
  ans = (ans << 8) ^ rand();
  ans = (ans << 8) ^ rand();
  ans %= r - l + 1;
  return int(ans + l);
}
int n, k, ans;
string s;
char a, b;
int dp[N][N], x[N];
inline void up(int& a, int b) {
  if (a < b) a = b;
}
int main() {
  file();
  for (int i = 0; i < 26; ++i)
    for (int j = 0; j < 26; ++j) dp[i][j] = -INF;
  cin >> n;
  while (n--) {
    cin >> s;
    a = s.front() - 'a';
    b = s.back() - 'a';
    k = s.size();
    for (int i = 0; i < 26; ++i) x[i] = dp[i][a] + k;
    for (int i = 0; i < 26; ++i) up(dp[i][b], x[i]);
    up(dp[a][b], k);
  }
  ans = 0;
  for (int i = 0; i < 26; ++i) up(ans, dp[i][i]);
  cout << ans;
}
