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;
int dp[1000001];
int idx[27];
char pp[1000001][11];
map<string, int> mp;
int main() {
  int a, b, c, d, e, f, g, h, x, y, z;
  cin >> a;
  f = 0;
  g = 0;
  for (x = 0; x < a; x++) {
    scanf("%s", pp[x]);
    string s = "";
    for (y = 0; y < strlen(pp[x]); y++) s += pp[x][y];
    mp[s]++;
  }
  idx[pp[a - 1][0] - 'a'] = strlen(pp[a - 1]);
  for (x = a - 2; x >= 0; x--) {
    dp[x] = strlen(pp[x]);
    b = pp[x][strlen(pp[x]) - 1] - 'a';
    dp[x] = max(dp[x], (int)strlen(pp[x]) + idx[b]);
    c = pp[x][0] - 'a';
    idx[c] = max(idx[c], dp[x]);
    if (dp[x] != strlen(pp[x])) f = max(f, dp[x]);
  }
  for (map<string, int>::iterator it = mp.begin(); it != mp.end(); it++) {
    if ((*it).second == 1) f = max(f, (int)(*it).first.size());
  }
  cout << f << endl;
}
