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 DynastyPuzzles {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int[][] ans = new int[26][26]; 
		//first state = starts with
		//second state = ends with
		int n = scan.nextInt();
		for(int i = 0; i < n; i++){
			String s = scan.next();
			int x = s.charAt(0)-'a';
			int y = s.charAt(s.length()-1)-'a';
			if(x != y){
				ans[x][y] = Math.max(ans[x][y], s.length());
				for(int j = 0; j < 26; j++){
					if(ans[j][x] != 0){
						ans[j][y] = Math.max(ans[j][y], ans[j][x]+s.length());
					}
				}
			}
			else{
				for(int j = 0; j < 26; j++){
					if(ans[j][x] != 0 || j == x) ans[j][x] = ans[j][x]+s.length();
				}
			}
		}
		int res = 0;
		for(int i = 0; i < 26; i++){
			//System.out.println(i+" "+ans[i][i]);
			res = Math.max(ans[i][i], res);
		}
		System.out.println(res);
	}
}

/*
8
abcd
da
dg
gam
ducf
jagu
dagg
maximuma
 */