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.*;

public class Main
	{
	public static void main(String args[]) throws IOException
		{
		Scanner c=new Scanner(System.in);
		int N=c.nextInt();
		String S[]=new String[N];
		int Val[][]=new int[26][26];				//currently longest path starting with i and ending with j
		for(int i=0;i<26;i++)
			Arrays.fill(Val[i],0);
		int max=0;
		for(int i=0;i<N;i++)
			{
			String s=c.next();
			S[i]=s;
			if(s.charAt(0)==s.charAt(s.length()-1))
				{
				if(s.length()>max)
					max=s.length();
				}
			}
		for(int i=0;i<N;i++)
			{
			int startChar=S[i].charAt(0)-'a';
			int endChar=S[i].charAt(S[i].length()-1)-'a';
			for(int j=0;j<26;j++)
				{
				if(Val[j][startChar]!=0)
					{
					if(Val[j][endChar]<Val[j][startChar]+S[i].length())
						Val[j][endChar]=Val[j][startChar]+S[i].length();
					}
				} 
			if(S[i].length()>Val[startChar][endChar])
				Val[startChar][endChar]=S[i].length();
			}
		for(int i=0;i<26;i++)
			{
			if(Val[i][i]>max)
				max=Val[i][i];
			}
		System.out.println(max);
		}
	}




//must declare new classes here
