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 __gnu_cxx;
using namespace std;
int DP[500001][128];
vector<string> v;
int dp(int ind, char c) {
  if (ind >= v.size()) return 0;
  int& ret = DP[ind][c];
  if (ret != -1) return ret;
  ret = 0;
  if (c == v[ind][0] || !c) {
    int x = 0;
    x = dp(ind + 1, v[ind][-1 + v[ind].size()]);
    if (c) {
      ret = max(ret, x + (int)v[ind].size());
    } else {
      if (v[ind].size() == 1)
        ret = max(ret, (int)v[ind].size());
      else {
        if (x != 0) ret = max(ret, x + (int)v[ind].size());
      }
    }
  }
  ret = max(ret, dp(ind + 1, c));
  return ret;
}
int main() {
  int n;
  while (cin >> n) {
    v.clear();
    v.resize(n);
    for (__typeof(n) i = 0; i < n; i++) cin >> v[i];
    memset(DP, -1, sizeof(DP));
    int x = 0;
    x = max(x, dp(0, 0));
    cout << x << endl;
  }
  return 0;
}
