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

	public static void main(String[] args)
	{
		new test6().run();
	}

	PrintWriter out = null;

	int[][] dp = new int[26][26];
	int n;
	String[] names = null;

	void run()
	{
		Scanner in = new Scanner(System.in);
		out = new PrintWriter(System.out);

		n = in.nextInt();
		names = new String[n];
		for (int i = 0; i < n; i++)
			names[i] = in.next();

		for (int i = n - 1; i >= 0; i--)
		{
			int first = names[i].charAt(0) - 'a';
			int last = names[i].charAt(names[i].length() - 1) - 'a';

			for (char c = 'a'; c <= 'z'; c++)
			{
				int mm = 0;
				if (dp[last][c - 'a'] > 0)
					mm = names[i].length() + dp[last][c - 'a'];
				dp[first][c - 'a'] = Math.max(dp[first][c - 'a'], mm);
			}

			dp[first][last] = Math.max(dp[first][last], names[i].length());
		}
		int max = 0;
		for (int i = 0; i < 26; i++)
			max = Math.max(max, dp[i][i]);

		out.println(max);
		out.close();
	}
}
