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;
const int N = 500001;
int n;
int first[N], last[N];
int len[N];
int dp[64][64];
vector<int> va, vb, vc;
void update(int st, int end, int val) {
  if (dp[st][end] < val) {
    va.push_back(st);
    vb.push_back(end);
    vc.push_back(val);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    char name[20];
    scanf("%s", name);
    len[i] = strlen(name);
    first[i] = name[0] - 'a';
    last[i] = name[len[i] - 1] - 'a';
  }
  int result = 0;
  memset(dp, -1, sizeof dp);
  for (int i = n - 1; i >= 0; i--) {
    va.clear();
    vb.clear();
    vc.clear();
    update(first[i], last[i], len[i]);
    for (int end = 0; end < 26; end++) {
      if (dp[last[i]][end] != -1) {
        update(first[i], end, dp[last[i]][end] + len[i]);
      }
    }
    for (int i = 0; i < va.size(); i++) {
      dp[va[i]][vb[i]] = vc[i];
    }
    int tresult = dp[first[i]][first[i]];
    if (tresult != -1 && tresult > result) {
      result = tresult;
    }
  }
  cout << result << endl;
  return 0;
}
