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.ArrayList;
import java.util.Scanner;

public class DynastyPuzzles192A {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		Name[] names = new Name[n];
		int max = 0;
		int[][] link = new int[26][n + 1];
		for (int i = 0; i < n; i++) {
			String name = in.next();
			names[i] = new Name(getFirst(name), getLast(name), name.length());
			int last = names[i].last;
			int il = ++link[last][0];
			link[last][il] = i;
		}
		int[][] v = new int[26][26];
		for (int i = 0; i < n; i++) {
			Name name = names[i];
			for (int start = 0; start < 26; start++) {
				if (v[start][name.first] > 0) {
					int value = v[start][name.first] + name.length;
					if (v[start][name.last] < value)
						v[start][name.last] = value;
				}
			}
			if (v[name.first][name.last] < name.length)
				v[name.first][name.last] = name.length;
		}
		for (int c = 0; c < 26; c++)
			if (v[c][c] > max)
				max = v[c][c];
		System.out.println(max);
	}

	private static int getFirst(String str) {
		return str.charAt(0) - 'a';
	}

	private static int getLast(String str) {
		return str.charAt(str.length() - 1) - 'a';
	}
}

class Name {
	int length;
	int first;
	int last;

	Name(int f, int l, int len) {
		first = f;
		last = l;
		length = len;
	}
}