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.math.BigInteger;
import java.util.ArrayList;

import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
import java.util.Vector;


public class Sourcecode {

    public static void main(String[] args) {
    Scanner input = new Scanner(System.in);
    int n=input.nextInt();
    boolean[][] access = new boolean[26][26];
    int[][] alpha=new int[26][26];
    for(int i=0;i<n;i++){
        String thestring = input.next();
        int thelength=thestring.length();
        int cstart=thestring.charAt(0)-'a';
        int cend=thestring.charAt(thelength-1)-'a';
        for(int j=0;j<26;j++){
        if(access[j][cstart]){
            alpha[j][cend]=Math.max(alpha[j][cstart]+thelength, alpha[j][cend]);
            access[j][cend]=true;
            //System.out.println(alpha[j][cend]+"j="+j+",cstart="+cstart+",cend="+cend);
        }
        }
        access[cstart][cend]=true;
        alpha[cstart][cend]=Math.max(thelength, alpha[cstart][cend]);
    }
    int max=0;
    for(int i=0;i<26;i++){
        if(alpha[i][i]>max){ max=alpha[i][i];}
    }
    System.out.println(max);
        
        
    }

}


    
