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.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class ProblemA {
    
    
    public static void main(String[] args) throws IOException {
        BufferedReader s = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.valueOf(s.readLine());
        String[] names = new String[n];
        for (int i = 0 ; i < n ; i++) {
            names[i] = s.readLine();
        }
        
        int[][] dp = new int[26][26];
        int flen = names[0].length();
        int ffc = names[0].charAt(0) - 'a';
        int flc = names[0].charAt(flen-1) - 'a';
        dp[ffc][flc] = flen; 
        for (int i = 1 ; i < n ; i++) {
            int nlen = names[i].length();
            int from = names[i].charAt(0) - 'a';
            int to = names[i].charAt(nlen-1) - 'a';
            for (int f = 0 ; f < 26 ; f++) {
                if (dp[f][from] >= 1) {
                    dp[f][to] = Math.max(dp[f][to], dp[f][from] + nlen);
                }
            }
            dp[from][to] = Math.max(dp[from][to], nlen);
        }
        
        long max = 0;
        for (int i = 0 ; i < 26 ; i++) {
            max = Math.max(max, dp[i][i]);
        }
        System.out.println(max);
    }
}