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.InputStream;
import java.io.InputStreamReader;
import java.util.*;

public class Dynasty {
	public static void main(String[] args) throws Exception{
		FastScanner reader = new FastScanner(System.in);
		int N = reader.nextInt();
		
		char[][] in = new char[N][];
		for(int i = 0; i < N; i++)
			in[i] = reader.next().toCharArray();
		
		int[][] memo = new int[27][N+1];
		for(int[] m:memo)Arrays.fill(m,-(int)1e9);
		
		int[] jump = new int[N];
		int[] next = new int[N];
		
		int[] p = new int[26];
		Arrays.fill(p,N);
		
		for(int i = N-1; i >= 0; i--){
			jump[i] = p[in[i][0]-'a'];
			next[i] = p[in[i][in[i].length-1]-'a'];
			p[in[i][0]-'a'] = i;
		}
		
		//Name, character seeking, first character
		for(int n = N-1; n >= 0; n--){
			for(int k = 0; k < 27; k++){
				if(k == 26){
					if(in[n][0] == in[n][in[n].length-1])
						memo[k][n] = Math.max(in[n].length, Math.max(in[n].length + memo[in[n][0]-'a'][next[n]], memo[26][n+1]));
					else
						memo[k][n] = Math.max(in[n].length + memo[in[n][0]-'a'][next[n]], memo[26][n+1]);
				}else{
					if(in[n][in[n].length-1]-'a' == k){
						memo[k][n] = Math.max(in[n].length, Math.max(in[n].length + memo[k][next[n]], memo[k][jump[n]]));
					}else{
						memo[k][n] = Math.max(in[n].length + memo[k][next[n]], memo[k][jump[n]]);
					}
				}
			}
		}
		
		System.out.println(Math.max(memo[26][0], 0));
	}
	
	static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
       
        FastScanner(InputStream in) throws Exception{
                br = new BufferedReader(new InputStreamReader(in));
                st = new StringTokenizer(br.readLine().trim());
        }
        public int numTokens() throws Exception {
                if(!st.hasMoreTokens()) {
                        st = new StringTokenizer(br.readLine().trim());
                        return numTokens();
                }
                return st.countTokens();
        }
        public String next() throws Exception {
                if(!st.hasMoreTokens()) {
                        st = new StringTokenizer(br.readLine().trim());
                        return next();
                }
                return st.nextToken();
        }
        public double nextDouble() throws Exception {
                return Double.parseDouble(next());
        }
        public long nextLong() throws Exception {
                return Long.parseLong(next());
        }
        public int nextInt() throws Exception {
                return Integer.parseInt(next());
        }
	}
}
