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;
using namespace chrono;
mt19937_64 randGen(system_clock().now().time_since_epoch().count());
mt19937 rnd(42);
const int N = 5e5 + 1;
const int E = 31;
struct Solver {
  int n, ln[N];
  int tb[N][2];
  void read() {
    string second;
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> second;
      ln[i] = second.length();
      tb[i][0] = second[0] - 'a';
      tb[i][1] = second[ln[i] - 1] - 'a';
    }
  }
  void solve() {
    int ans = 0;
    int dp[E][E] = {};
    for (int i = 0; i < n; i++) {
      int x = tb[i][0];
      int y = tb[i][1];
      for (int j = 0; j < E; j++) {
        if (dp[j][x] > 0) {
          dp[j][y] = max(dp[j][y], dp[j][x] + ln[i]);
        }
      }
      dp[x][y] = max(dp[x][y], ln[i]);
    }
    for (int i = 0; i < E; i++) {
      ans = max(ans, dp[i][i]);
    }
    cout << ans;
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  Solver sol;
  sol.read();
  sol.solve();
  return 0;
}
