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;
long long POS(long long x) {
  if (x > 0)
    return x;
  else
    return 0;
}
struct ysh {
  long double z, y, x;
  ysh() {}
  ysh(long double z, long double y, long double x) : z(z), y(y), x(x) {}
  ysh operator+(const ysh &p) const { return ysh(z + p.z, y + p.y, x + p.x); }
  ysh operator-(const ysh &p) const { return ysh(z - p.z, y - p.y, x - p.x); }
  ysh operator*(long double con) const {
    return ysh(z * con, y * con, x * con);
  }
  ysh operator/(long double con) const {
    return ysh(z / con, y / con, x / con);
  }
  bool operator<(const ysh &rhs) const {
    return make_pair(z, make_pair(y, x)) <
           make_pair(rhs.z, make_pair(rhs.y, rhs.x));
  }
  bool operator==(const ysh &rhs) const {
    return make_pair(z, make_pair(y, x)) ==
           make_pair(rhs.z, make_pair(rhs.y, rhs.x));
  }
};
struct node {
  char end;
  int val;
};
long long arr[100][100] = {0};
long long l;
inline void find(int x, int y) {
  long long ans;
  for (int j = (0); j < (26); ++j) {
    if (arr[j][x] > 0) {
      arr[j][y] = max(arr[j][y], arr[j][x] + l);
    }
  }
  arr[x][y] = max(arr[x][y], l);
}
int main() {
  long long n, m;
  cin >> n;
  int x, y;
  string s;
  for (int i = (0); i < (n); ++i) {
    cin >> s;
    l = s.size();
    x = s[0] - 'a';
    y = s[l - 1] - 'a';
    find(x, y);
  }
  long long ans = 0;
  for (int i = (0); i < (26); ++i) {
    ans = max(ans, arr[i][i]);
  }
  cout << ans << endl;
  return 0;
}
