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.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class con121_C2 {

	public static void main( final String[] args ) throws Exception {
		final BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );
		final int n = Integer.parseInt( br.readLine() );
		final String[] sa = new String[n];
		for ( int i = 0; i < n; ++i ) {
			sa[ i ] = br.readLine();
		}
		System.out.println( solve( sa ) );
	}

	public static int solve( final String[] sa ) {
		final int d = 'z' - 'a' + 1;
		final int[][] max = new int[d][d];
		for ( int i = 0; i < d; ++i )
			Arrays.fill( max[ i ], 0 );

		for ( int i = 0; i < sa.length; ++i ) {
			final char f = sa[ i ].charAt( 0 );
			final char l = sa[ i ].charAt( sa[ i ].length() - 1 );
			for ( int j = 0; j < d; ++j ) {
				if ( max[ j ][ f - 'a' ] > 0 && max[ j ][ f - 'a' ] + sa[ i ].length() > max[ j ][ l - 'a' ] )
					max[ j ][ l - 'a' ] = max[ j ][ f - 'a' ] + sa[ i ].length();
			}
			if ( max[ f - 'a' ][ l - 'a' ] < sa[ i ].length() ) {
				max[ f - 'a' ][ l - 'a' ] = sa[ i ].length();
			}
		}
		int res = max[ 0 ][ 0 ];
		for ( int i = 0; i < d; ++i ) {
			if ( max[ i ][ i ] > res ) res = max[ i ][ i ];
		}
		return res;
	}
}
