#include <iostream>

 #include <cstring>

 #include <algorithm>

 #include <cstdio>

 using namespace std;

 char ch[][];

 int vis[];

 int n,Max;

 int judge(int x,int y)

 {

     int i,j;

     //cout<<ch[x]<<" "<<ch[y]<<endl;

     int len1=strlen(ch[x]);

     int len2=strlen(ch[y]);

     for(i=len1-;i>=&&(len1-i)<=len2;i--)

     {

         int k1=i,k2=;

         for(;k1<len1;k1++,k2++)

             if(ch[x][k1]!=ch[y][k2])

                 break;

         if(k1==len1)

         {

             if((len1-i)==strlen(ch[y]))

                 return ;

             else

                 return len1-i;

         }

     }

     return ;

 }

 void dfs(int f,int sum)

 {

     int i,j;

     if(sum>Max)

         Max=sum;

     for(i=;i<=n;i++)

     {

         if(vis[i]>=)

             continue;

         int ans=judge(f,i);

         if(ans!=)

         {

             vis[i]++;

             //cout<<strlen(ch[i])-ans<<endl;

             dfs(i,sum+strlen(ch[i])-ans);

             vis[i]--;

         }

     }

     return;

 }

 int main()

 {

     int i,j;

     freopen("in.txt","r",stdin);

     while(scanf("%d",&n)!=EOF)

     {

         Max=;

         memset(vis,,sizeof(vis));

         for(i=;i<=n;i++)

             scanf("%s",ch[i]);

         scanf("%s",ch[]);

         dfs(,strlen(ch[]));

         printf("%d\n",Max);

     }

     return ;

 }