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 King{
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		int[][] data = new int[26][26];
	
		int n = stdIn.nextInt();
		String[] king = new String[n];
		char[] first = new char[n];
		char[] last = new char[n];
		int[] len = new int[n];
	
		for(int i = 0; i < n; i++){
			king[i] = stdIn.next();
			first[i] = king[i].charAt(0);
			last[i] = king[i].charAt(king[i].length()-1);
			len[i] = king[i].length();
		}
		for(int i = n-1; i >= 0; i--){	
			int f = (int)(first[i]-'a');
			int l = (int)(last[i]-'a');
			if( f == l ){
				data[f][f] += len[i];
			} else if( data[f][l] < len[i]+data[l][l] ){
				data[f][l] = len[i]+data[l][l];
			}
			for(int j = 0; j < 26; j++){
				if( data[l][j] != 0 && j != l){
					if( data[f][j] < data[l][j]+len[i] ){
						data[f][j] = data[l][j]+len[i];
					}
				} 
			}			
		}
	/*	for(int i = 0; i < 26; i++){
			for(int j = 0; j < 26; j++){
				System.out.print(data[i][j] + " ");
			}
			System.out.println();
		}*/
		int max = 0;
		for(int i = 0; i < 26; i++){
			if( data[i][i] > max ){
				max = data[i][i];
			}
		}
		System.out.println(max);
		
	}
}