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

public class C {
    static int[][] next;
    static int[][] dp;
    static String[] input;
    static int inf = 100000000;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        input = new String[n];
        for (int i = 0; i < n; i++) {
            input[i] = br.readLine();
        }
        next = new int[n][2];
        ArrayList<Integer>[] list = new ArrayList[26];
        for (int i = 0; i < 26; i++) {
            list[i] = new ArrayList<Integer>();
        }
        for (int i = 0; i < n; i++) {
            list[input[i].charAt(0) - 'a'].add(i);
        }
        for (int i = 0; i < n; i++) {
            int[] ar = new int[] { input[i].charAt(0) - 'a',
                    input[i].charAt(input[i].length() - 1) - 'a' };
            int idx=0;
            for (int j : ar) {
                int l = 0, h = list[j].size(), mid;
                while (l < h) {
                    mid = l + (h - l) / 2;
                    if (list[j].get(mid) <= i) {
                        l = mid + 1;
                    } else {
                        h = mid;
                    }
                }
                if (l == list[j].size() || list[j].get(l) <= i) {
                    next[i][idx++] = -1;
                } else {
                    next[i][idx++] = list[j].get(l);
                }
            }
        }
        dp = new int[27][n];
        for(int curIdx=n-1;curIdx>=0;curIdx--){
        for(int stLetter=26;stLetter>=0;stLetter--){
            
                int start = input[curIdx].charAt(0) - 'a';
                int end = input[curIdx].charAt(input[curIdx].length() - 1) - 'a';
                int res = 0;
                if (stLetter == 26) {
                    if (start == end) {
                        if (next[curIdx][1] != -1) {
                            res = Math.max(input[curIdx].length() + dp[start][ next[curIdx][1]], input[curIdx].length());
                        } else {
                            res = input[curIdx].length();
                        }
                    } else {
                        
                        if (next[curIdx][1] != -1) {
                            res = input[curIdx].length() + dp[start][next[curIdx][1]];
                        } else {
                            res = -inf;
                        }
                    }
                } else {
                    if (stLetter == end) {
                        if (next[curIdx][1] != -1) {
                            res = Math.max(input[curIdx].length() + dp[stLetter][next[curIdx][1]], input[curIdx].length());
                        } else {
                            res = input[curIdx].length();
                        }
                        if (next[curIdx][0] != -1) {
                            res = Math.max(res, dp[stLetter][next[curIdx][0]]);
                        }
                    } else {
                        if (next[curIdx][1] != -1) {
                            res = input[curIdx].length() + dp[stLetter][next[curIdx][1]];
                        } else {
                            res = -inf;
                        }
                        if (next[curIdx][0] != -1) {
                            res = Math.max(res, dp[stLetter][next[curIdx][0]]);
                        }
                    }
                }
                dp[stLetter][curIdx] = res;
            }
        }
        int max = 0;
        for (int i = 0; i < n; i++) {
            max = Math.max(max, dp[26][i]);
        }
        System.out.println(max);
    }
}