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.*;
import java.util.StringTokenizer;
import java.util.stream.Stream;

public class a121 {
    static PrintWriter out;
    static BufferedReader in;
    static StringTokenizer st;

    public static void main(String[] args) throws FileNotFoundException {
        out = new PrintWriter(System.out);
        in = new BufferedReader(new InputStreamReader(System.in));
        new a121().Run();
        out.close();
    }

    String ns() {
        try {
            if (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(in.readLine());
            }
            return st.nextToken();
        } catch (Exception e) {
            return null;
        }
    }

    int nextint() {
        return Integer.valueOf(ns());
    }

    String nextline() {
        st = null;
        try {
            return in.readLine();
        } catch (Exception e) {
            return null;
        }
    }

    public void Run() {
        int n = nextint();

        char [][] arr = new char[n][];
        for(int i = 0; i <n; i++){
            arr[i] = nextline().toCharArray();
        }

        int[][] dp  = new int[26][26];

        int[] first = new int[n];
        int[] last = new int[n];

        for(int i = 0; i < n; i++){
            first[i] = arr[i][0] - 'a';
            last[i] = arr[i][arr[i].length-1] -'a';
        }
        dp[first[0]][last[0]] = arr[0].length;
        for(int i = 1; i < n; i++){
            for(int j = 0; j < 26; j++){
                if (dp[j][first[i]] != 0){
                    dp[j][last[i]] = Math.max(dp[j][last[i]], arr[i].length + dp[j][first[i]]);
                }
            }
            dp[first[i]][last[i]] = Math.max(dp[first[i]][last[i]], arr[i].length);
        }
        int res = 0;
        for(int i = 0; i < dp.length; i++){
            res = Math.max(dp[i][i], res);
        }
        out.print(res);
    }
}