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;
bool presente[26][26];
char dinastia[500000][26];
int F[500000][26];
int len[500000];
int N;
int res = 0;
int maxi[26][26][26];
int main(void) {
  cin >> N;
  for (int i = 0; i < N; i++) {
    char str[11];
    cin >> str;
    int l = strlen(str);
    len[i] = l;
    dinastia[i][0] = str[0];
    dinastia[i][1] = str[l - 1];
  }
  for (int i = N - 1; i >= 0; i--) {
    int da = dinastia[i][0] - 'a', a = dinastia[i][1] - 'a';
    for (int f = 0; f < 26; f++) {
      for (int k = 0; k < 26; k++)
        if (presente[a][k]) {
          F[i][f] = maxi[a][k][f] + len[i];
          if (da == f) res = max(res, F[i][f]);
        }
      maxi[da][a][f] = max(maxi[da][a][f], F[i][f]);
    }
    if (!presente[da][a]) presente[da][a] = true;
    F[i][a] = max(F[i][a], len[i]);
    maxi[da][a][a] = max(maxi[da][a][a], len[i]);
    if (da == a) res = max(res, F[i][a]);
  }
  cout << res;
  return 0;
}
