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.*;
public class CF_191A {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);

        int n = Integer.parseInt(s.nextLine());
        int[][] dp = new int[26][26];

        word[] words = new word[n];
        for(int i = 0; i < n; i++) {
            words[i] = new word(s.nextLine());
            //System.out.println(words[i].length);
        }

        int max = 0;
        for(int i = 0; i < n; i++) {
            word focus = words[i];
            boolean skip = false;

            if(dp[focus.first][focus.last] == 0) {
                dp[focus.first][focus.last] = focus.length;
                skip = true;
            }
            for(int j = 0; j < 26; j++) {
               if(dp[j][focus.first] == 0) {
                    continue;
               }
               if(skip && j == focus.first) {
                   continue;
               }
               dp[j][focus.last] = Math.max(dp[j][focus.first] + focus.length, dp[j][focus.last]);
            }


            /**
            for(int[] x : dp) {
                for(int y : x) {
                    System.out.print(y + " ");
                }
                System.out.println();
            }
            System.out.println();
             **/

            //System.out.println(dp[focus.last][focus.last]);
        }
        for(int i = 0; i < 26; i++) {
            if(dp[i][i] > max) max = dp[i][i];
        }


        /**
        for(int[] x : dp) {
            for(int y : x) {
                System.out.print(y + " ");
            }
            System.out.println();
        }
         **/

        System.out.println(max);
    }
}
class word {
    int first, last, length;
    word(String s) {
        first = s.charAt(0) - 'a';
        length = s.length();
        last = s.charAt(length-1) - 'a';
    }
}