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

import java.io.*;
import java.util.*;

public class C {
    public static void main(String[] args) throws Exception {
        new C().solve();
    }

    void solve() throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(in.readLine());

        int[][] king = new int[n][3];// first,last,len
        for (int i = 0; i < n; i++) {
            String s = in.readLine();
            king[i][0] = s.charAt(0) - 'a';
            king[i][1] = s.charAt(s.length() - 1) - 'a';
            king[i][2] = s.length();
        }

        int[][][] dp = new int[n][26][26];// [a][b][c]: a~n、bからリレー、cで終わる長さ
        dp[n - 1][king[n - 1][0]][king[n - 1][1]] = king[n - 1][2];
        for (int k = n - 2; k >= 0; k--) {
            for (int f = 0; f < 26; f++) {
                for (int l = 0; l < 26; l++) {
                    // k使わない
                    dp[k][f][l] = dp[k + 1][f][l];
                    if (f == king[k][0]) {
                        if (dp[k + 1][king[k][1]][l] != 0
                                || l == king[k][0]) {
                            // k使う
                            dp[k][f][l] = Math.max(dp[k][f][l], king[k][2] + dp[k + 1][king[k][1]][l]);
                        }
                    }
                }
            }
        }
        int max = 0;
        // 2
        for (int k = 0; k < n - 1; k++) {
            if (dp[k + 1][king[k][1]][king[k][0]] != 0) {
                max = Math.max(max, king[k][2] + dp[k + 1][king[k][1]][king[k][0]]);
            }
        }
        // 1
        for (int k = 0; k < n; k++) {
            if (king[k][0] == king[k][1]) {
                max = Math.max(max, king[k][2]);
            }
        }
        System.out.println(max);
    }
}
