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.util.Arrays;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;

    public class Test {
            public static void main(String args[]){
            	Scanner input = new Scanner(System.in);
                   	int n = input.nextInt();
                   	String[] a = new String[n];
                   	for(int i = 0 ; i < n ; i++){
                   		a[i] = input.next();
                   	}
                    System.out.println(maximum(n,a));
            }
            
          public static int maximum(int n,String[] a){
        	  int maxsim = 0;
        	  for(int i = 0 ; i < n ; i++){
        		  for(int j = i ; j < n ; j++){
        			  if(i == j){
        				  if(a[i].charAt(0) == a[i].charAt(a[i].length()-1)){
        					  maxsim = Math.max(maxsim, a[i].length());
        				  }
        			  }else{
        				  if(a[i].charAt(0) == a[j].charAt(a[j].length()-1) && a[j].charAt(0) == a[i].charAt(a[i].length()-1)){
        					  maxsim = Math.max(maxsim, a[i].length()+a[j].length());
        				  } 
        			  }
        		  }
        	  }
        	  return maxsim;

          }
        

    }