sωēeτ¨fαrm

procedure search(c:string);
var
 i,j,k:integer;
 s2:string;
begin
 for i:=1 to n do
  if (not ss[i]) or (not ss[i+n]) then
  begin
   s2:=copy(s[i],1,length(c));
   if s2=c then
   begin
    if not ss[i] then ss[i]:=true else ss[i+n]:=true;
    len:=len+length(s[i])-length(c);
    if len>max then max:=len;
    for k:=2 to length(s[i]) do
     search(copy(s[i],k,length(s[i])+1-k));
    len:=len+length(c)-length(s[i]);
    if ss[i+n] then ss[i+n]:=false else ss[i]:=false;
   end;
  end;
end;

begin
 readln(n);
 for i:=1 to n do
  readln(s[i]);
 readln(c);
 fillchar(ss,sizeof(ss),0);
 len:=1;max:=1;
 search(c);
 writeln(max);
end.