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


// Java

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

public class DynastyPuzzles {
    public static void main(String args[]) {

        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        
        int numNames;
        String[] names;
        try {   
            numNames = Integer.parseInt(in.readLine());
            names = new String[numNames];
            for (int i = 0; i < numNames; i++) {
                names[i] = in.readLine();
            }
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
        
        int[][] maxVals = new int[26][26];
        for (int i = 0; i < 26; i++) {
            for (int j = 0; j < 26; j++) {
                maxVals[i][j] = 0;
            }
        }
        
        for (int i = names.length-1; i >= 0; i--) {
            dynasty(maxVals, names, i);   
        }
        
        int max = 0;
        for (int a = 0; a < 26; a++) {
            if (maxVals[a][a] > max) {
                max = maxVals[a][a];
            }
        }
        
        // for (int a = 0; a < 26; a++) {
        //     for (int b = 0; b < 26; b++) {
        //         System.out.print(maxVals[a][b] + " ");
        //     }
        //     System.out.println();
        // }
        
        System.out.println(max);
    }
    
    public static void dynasty(int[][] maxVals, String[] names, int i) {
        if (i < 0) {
            return;
        }
        
        char[] name = names[i].toCharArray();
        char first = name[0];
        char last = name[name.length-1];
        
        for (int a = 0; a < 26; a++) {
            if (maxVals[last-'a'][a] != 0) {
                //System.out.println("Adding " + name.length + "to maxVals[" + first-'a' + "][" + a");
                maxVals[first-'a'][a] = Math.max(maxVals[last-'a'][a] + name.length, maxVals[first-'a'][a]);
            }
        }
        
        if (maxVals[first-'a'][last-'a'] < name.length) {
            //System.out.println("length = " + name.length);
            maxVals[first-'a'][last-'a'] = name.length;
        }
    }
}