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>
void printmatrix(int mat[26][26]) {
  int i, j;
  for (i = 0; i < 5; i++) {
    for (j = 0; j < 5; j++) printf("%d ", mat[i][j]);
    printf("\n");
  }
}
int maxx(int a, int b) {
  if (a > b)
    return a;
  else
    return b;
}
int main() {
  char king[11];
  int mat[26][26], n, f, l, i, j, len, temp, flag = 0;
  int max = -999;
  scanf("%d", &n);
  for (i = 0; i < 26; i++)
    for (j = 0; j < 26; j++) mat[i][j] = 0;
  for (i = 0; i < n; i++) {
    scanf("%s", king);
    len = strlen(king);
    f = king[0] - 'a';
    l = king[len - 1] - 'a';
    for (j = 0; j < 26; j++) {
      if (mat[j][f] > 0) {
        mat[j][l] = maxx(mat[j][l], mat[j][f] + len);
      }
    }
    if (mat[f][l] <= len) {
      mat[f][l] = len;
    }
  }
  for (i = 0; i < 26; i++) {
  }
  for (i = 0; i < 26; i++)
    if (mat[i][i] > max) max = mat[i][i];
  printf("%d\n", max);
  return 0;
}
