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

//package com.company;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
	// write your code here
        Scanner s = new Scanner(System.in);

        int t=s.nextInt();long max=0;char[] start=new char[123];long[][]dp=new long[123][123];
while(t-->0){
   char[] a=s.next().toCharArray();

    for(int i=97;i<123;i++){
 //     if(i==(int) a[0]&&dp[i][a[a.length-1]]==a.length) continue;
   if(dp[i][(int)a[0]]>0)
    dp[i][(int)a[a.length-1]]=Math.max(dp[i][a[0]]+a.length,dp[i][a[a.length-1]]);

     if(dp[i][(int)a[a.length-1]]>max&&i==(int)a[a.length-1]) {
     //    System.out.println(t);
         max=dp[i][(int)a[a.length-1]];
        // System.out.println((char)i+" "+a[a.length-1]);
     }
  //   if(dp[a[a.length-1]]==a.length) start[a[a.length-1]]=a[0];
        //   else start[a[a.length-1]]=start[a[0]];
   // if(a[a.length-1]==start[a[a.length-1]]&&dp[a[a.length-1]]>max){
   //    max=dp[a[a.length-1]];
   }    dp[a[0]][a[a.length-1]]=Math.max(dp[a[0]][a[a.length-1]],a.length);
    if(dp[a[0]][a[a.length-1]]>max&&a[0]==a[a.length-1]) max=dp[a[0]][a[a.length-1]];
    if(dp[a[0]][(int)a[a.length-1]]>max&&a[0]==(int)a[a.length-1]) {
        //    System.out.println(t);
        max = dp[a[0]][(int) a[a.length - 1]];
    }
}

        System.out.println(max);
    }
}
