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.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;

import java.util.Hashtable;
import java.util.Map;
import java.util.Set;
import java.util.HashSet;

public class Main {
    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        BufferedReader in = new BufferedReader( new InputStreamReader( inputStream ) ); 
        PrintWriter out = new PrintWriter(outputStream);
        TaskCC solver = new TaskCC();
        solver.solve(in, out);
        in.close();
        out.close();
    }
}

class TaskCC {
    
    int n;
    String[] names;
    Set<Integer>[] nameGroups;

    public int doDP(){
        
        int dp[][] = new int[n][26];
        for(int i = 0; i < n; i++){
            Arrays.fill(dp[i], 0);
            dp[i][names[i].charAt(0)-'a'] = names[i].length(); 
        }
        
        for(int i = 1; i < n; i++){
            
            char firstC = names[i].charAt(0);
            int groupI = firstC - 'a';
            
            for(int j : nameGroups[groupI]){
                
                if(i == j)
                    continue;
                
                for(int k = 0; k < 26; k++){
                    
                    char lastC = names[j].charAt(names[j].length()-1);
                    if(firstC == lastC && dp[j][k] > 0 && dp[j][k] + names[i].length() > dp[i][k]){
                        dp[i][k] = dp[j][k] + names[i].length();
                    }
                    
                }
                
            }
            
        }

        int maxLen = 0;
        for(int i = 0; i < n; i++){
            
            char lastC = names[i].charAt(names[i].length()-1);
            if(dp[i][lastC-'a'] > maxLen)
                maxLen = dp[i][lastC-'a'];
            
        }
        
        return maxLen;
    }
    
    public void solve(BufferedReader in, PrintWriter out) throws IOException{
        
        n = Integer.parseInt(in.readLine());
        nameGroups = new Set[26];
        for(int i = 0; i < 26; i++)
            nameGroups[i] = new HashSet<Integer>();
        
        names = new String[n];
        for(int i = 0; i < n; i++){
            names[i] = in.readLine();
            int lastChar = names[i].charAt(names[i].length()-1) - 'a';
            nameGroups[lastChar].add(i);
        }
    
        out.println(doDP());
        
    }
}