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.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		while(scan.hasNext()){
		int N = scan.nextInt();
        int A[]=new int [N];
        int B[]=new int [N];
        int len[]=new int [N];
        for(int i=0;i<N;i++){
        	String str=scan.next();
        	A[i]=str.charAt(0)-'a';
        	len[i]=str.length();
        	B[i]=str.charAt(len[i]-1)-'a';
        }
        int f[][]=new int [27][27];
        for(int m=0;m<N;m++){
        for(int i=0;i<26;i++){  
            if(f[i][A[m]]>0)  
                f[i][B[m]] = Math.max(f[i][B[m]],f[i][A[m]]+len[m]);}  
        f[A[m]][B[m]] = Math.max(f[A[m]][B[m]],len[m]);  
    } 
        int ans =0;
    for(int i=0;i<26;i++)  
        ans = Math.max(ans,f[i][i]);  

		System.out.println(ans);
		
		}
		
		
		
	}
}
		 	   	  	 	  		 	 	 	  	