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 Main {  
	
 	public static void main(String[] args) {
      Scanner a = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
      while(a.hasNext()){
      int n = a.nextInt();
      int[][] dp = new int[26][26];
      String s;
      for(int i=0;i<n;i++){
    	  s = a.next();
    	  int head=s.charAt(0)-(int)'a';
    	  int tail=s.charAt(s.length()-1)-(int)'a';
    	  for(int j=0;j<26;j++)
    		  if(dp[j][head]>0)
    			  dp[j][tail]=Math.max(dp[j][tail], dp[j][head]+s.length());
    	  dp[head][tail]=Math.max(dp[head][tail], s.length());
    	  
      }
     
      
      int max=0;
      for(int i=0;i<26;i++)
    	  if(dp[i][i]>max)
    		  max=dp[i][i];
      System.out.println(max);
 	}
 	}
}
	  		 	 		  			 		 	 				