#include<iostream>

 #include<cstdio>

 #include<queue>

 #include<algorithm>

 #include<cmath>

 #include<ctime>

 #include<set>

 #include<map>

 #include<stack>

 #include<cstring>

 #define inf 2147483647

 #define For(i,a,b) for(register int i=a;i<=b;i++)

 #define p(a) putchar(a)

 #define g() getchar()

 //by war

 //2017.10.29

 using namespace std;

 char a[],c[][];

 int n;

 int la,lb;

 bool flag;

 int f[];

 int mx;

 void in(int &x)

 {

     int y=;

     char c=g();x=;

     while(c<''||c>'')

     {

     if(c=='-')

     y=-;

     c=g();

     }

     while(c<=''&&c>='')x=x*+c-'',c=g();

     x*=y;

 }

 void o(int x)

 {

     if(x<)

     {

         p('-');

         x=-x;

     }

     if(x>)o(x/);

     p(x%+'');

 }

 int main()

 {

     cin>>(a+);

     la=strlen(a+);

     in(n);

     For(i,,n)

     cin>>(c[i]+);

     For(i,,la)

     {

         f[i]=mx;

         For(j,,n)

         {

             flag=false;

             lb=strlen(c[j]+);

             if(lb<=i)

             {

             For(k,,lb)

             if(a[i-lb+k]!=c[j][k])

             {

                 flag=true;

                 break;

             }

             if(!flag)

             f[i]=max(f[i],f[i-lb]+);

             }

         }

         if(f[i]>mx)

         mx=f[i];

     }

     o(f[la]);

      return ;

 }