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.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class  test2  {
	
	//ArrayList<Integer> lis = new ArrayList<Integer>();
	//ArrayList<String> lis = new ArrayList<String>();
	//
//	static long sum=0;
	//int a,b,c;
	//1000000007 (10^9+7)
	static int mod = 1000000007;
	static String s[];

	
public  static void main(String[] args) {
   Scanner sc =new Scanner(System.in);
   while(sc.hasNext()){
		 // =ni(sc)
	   //long sum=0;
	 // int d=sc.nextInt(),m=sc.nextInt(),pr=d;
	 int  n=sc.nextInt(),r=0;
     s = new String[n];
	 for(int i=0; i<n; i++){s[i]=sc.next(); 
	 if( s[i].charAt(s[i].length()-1)==s[i].charAt(0))r=max(r,s[i].length());  }
	 int dp[][][]=new int[2][26][26];
	 
	 for(int i=0; i<n ; i++){
		 
		String a=s[i];
		if( dp[i%2][(int)(a.charAt(0)-'a')][(int)(a.charAt(a.length()-1)-'a')]!=0 ){
			r=max( r, dp[i%2][(int)(a.charAt(0)-'a')][(int)(a.charAt(a.length()-1)-'a')]+a.length() );
		}
		for(int t=0; t<26 ; t++){
			
	    if( dp[i%2][(int)(a.charAt(0)-'a')][t]!=0){
	              dp[i%2][(int)(a.charAt(a.length()-1)-'a')][t]=max(dp[i%2][(int)(a.charAt(a.length()-1)-'a')][t], dp[i%2][(int)(a.charAt(0)-'a')][t]+a.length());		
	    }
	    
		}
		
		  
			dp[i%2][(int)(a.charAt(a.length()-1)-'a')][(int)(a.charAt(0)-'a')]=
					max(dp[i%2][(int)(a.charAt(a.length()-1)-'a')][(int)(a.charAt(0)-'a')],a.length());
		   
	if(i<n-1)for(int t=0; t<26 ; t++)
				dp[(i+1)%2][t] = dp[i%2][t];
		
	 }
	 
	 System.out.println(r);
 
   } 
}  



    static void db(Object... os){
	         System.err.println(Arrays.deepToString(os));
 
	}

}

