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

//package codeforce;
import java.io.*;
import java.util.*;
public class DynastyPuzzles {
    public static void main(String[] args) throws Exception
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw=new PrintWriter(System.out);
        int n=Integer.parseInt(br.readLine());
        int[] len=new int[n];
        char[] start=new char[n];
        char[] end=new char[n];
        int[][] dp=new int[26][26];
        for(int i=0;i<n;i++)
        {
            String temp=br.readLine();
            len[i]=temp.length();
            start[i]=temp.charAt(0);
            end[i]=temp.charAt(len[i]-1);
            for(int j=0;j<26;j++)
            {
                if(dp[j][start[i]-'a']!=0)
                {
                dp[j][end[i]-'a']=Math.max(dp[j][start[i]-'a']+len[i],dp[j][end[i]-'a']);
                }
            }
            dp[start[i]-'a'][end[i]-'a']=Math.max(dp[start[i]-'a'][end[i]-'a'],len[i]);
        }
        int ans=0;
        for(int i=0;i<26;i++)
        {
            ans=Math.max(ans, dp[i][i]);
            /*for(int j=0;j<26;j++)
            {
                pw.print(dp[i][j]+" ");
            }
            pw.println();*/
        }
        pw.println(ans);
        pw.close();
    }

}
