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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Test {
	static BufferedReader reader;
	static StringTokenizer tokenizer;
	static PrintWriter writer;

	static int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	static String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(reader.readLine());
		}
		return tokenizer.nextToken();
	}

	public static void main(String[] args) throws IOException {
		reader = new BufferedReader(new InputStreamReader(System.in));
		tokenizer = null;
		writer = new PrintWriter(System.out);
		solve();
		reader.close();
		writer.close();
	}
	
	private static void solve() throws IOException {
		int n = nextInt();
		String[] mas = new String[n];
		for(int i=0;i<n;i++)
		{
			mas[i]=nextToken();
		}
		
		int[][] f = new int[26][26];
		
		for(int i=0;i<n;i++)
		{
			int len = mas[i].length();
			for(char c='a';c<='z';c++)
			{
				if(f[c-'a'][mas[i].charAt(0)-'a']>0)
				{
					f[c-'a'][mas[i].charAt(len-1)-'a'] 	= Math.max(f[c-'a'][mas[i].charAt(len-1)-'a'],f[c-'a'][mas[i].charAt(0)-'a']+len);
				}
			}
			f[mas[i].charAt(0)-'a'][mas[i].charAt(len-1)-'a'] 	= Math.max(f[mas[i].charAt(0)-'a'][mas[i].charAt(len-1)-'a'],len);
		}
		
//		for(char c='a';c<='z';c++)
//		{
//			for(char c2='a';c2<='z';c2++)
//			{
//				writer.print(f[c-'a'][c2-'a']+"");
//			}
//			writer.println();
//		}
		
		int mx=0;
		for(char c='a';c<='z';c++)
		{
			if(f[c-'a'][c-'a']>mx)
				mx=f[c-'a'][c-'a'];
		}
		writer.println(mx);		
	}
}