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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;

public class Main {

    
    public static void main(String[] args) {
        InputScannerf s = new InputScannerf(System.in);
        
        int n = s.nextInt();
        String names[] = new String[n];
        for (int i = 0; i < n; i++) {
            names[i] = s.next();
        }
        
        
        int val[][] = new int[30][30];  // [first_char] [ last_char ]
        for (int i = 0; i < 30; i++) {
            for (int j = 0; j < 30; j++) {
                val[i][j] = -1;
            }
        }
        
        
        
        for (int i = 0; i < names.length; i++) {
            String king = names[i];
            int len = king.length();
            
            int first = king.charAt(0) - 'a';
            int last = king.charAt(len-1) - 'a';
            
            for (int j = 0; j < 30; j++) {
                if(val[j][first] > -1)
                    val[j][last] = Math.max(val[j][last], val[j][first] + len);
            }
            
            val[first][last] = Math.max(val[first][last], len);
            
        }
        
        int res = 0;
        for (int i = 0; i < 30; i++) {
            res = Math.max(res,val[i][i]);
        }
        
        System.out.println(res);
    }

}


class InputScannerf {
    BufferedReader br;
    StringTokenizer strtok = null;

    public InputScannerf(InputStream stream) {
        br = new BufferedReader(new InputStreamReader(stream));

    }

    public InputScannerf(File file) throws FileNotFoundException {
        br = new BufferedReader(new FileReader(file));
    }

    public String next() {
        if (strtok == null || !strtok.hasMoreTokens()) {
            try {
                strtok = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return strtok.nextToken();
    }

    public int nextInt() {
        int i;
        try {
            i = Integer.parseInt(next());
        } catch (NumberFormatException e) {
            throw new RuntimeException(e);
        }
        return i;
    }

    public String nextLine() {
        if (strtok == null || !strtok.hasMoreTokens()) {
            try {
                strtok = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return strtok.nextToken("\n").trim();
    }

}