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 C {
	public static int solve(int n, String[] names) {
		int ans = 0;
		int[][] dp0 = new int[26][26];
		for (int i = 0; i < n; i++) {
			String name = names[i].toLowerCase();
			int beg = name.charAt(0) - 'a';
			int end = name.charAt(name.length() - 1) - 'a';
			for (int b = 0; b < 26; b++) {
				if (dp0[b][beg] > 0) {
					dp0[b][end] = dp0[b][beg] + name.length();
				}
			}
			dp0[beg][end] = Math.max(name.length(),dp0[beg][end]);
		}

		for (int i = 0; i < 26; i++) {
			if (dp0[i][i] > ans) {
				ans = dp0[i][i];
			}
		}
		return ans;
	}

	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		while (cin.hasNext()) {
			int n = cin.nextInt();
			String[] names = new String[n];
			for (int i = 0; i < n; i++) {
				names[i] = cin.next();
			}
			System.out.println(solve(n, names));
		}
		cin.close();
	}
}
