/**************************************************************Problem: 2121User: BLADEVILLanguage: C++Result: AcceptedTime:132 msMemory:158900 kb
****************************************************************///By BLADEVIL
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 200
#define maxm 1010using namespace std;struct node{int cnt,num; node *child[30];node(){ cnt=num=0;memset(child,0,sizeof child);}
}nodepool[maxm],*totnode,*rot;char s[maxn];
int flag[maxn][maxn],vis[maxn][maxm][maxn],w[maxn];
int n,len;void build_trie(){int j=1;totnode=nodepool; rot=totnode++;scanf("%d",&n);char ch[maxn];while (n--) {scanf("%s",ch);int len=strlen(ch);node *t=rot;for (int i=0;i<len;i++) {if (!t->child[ch[i]-'a']) t->child[ch[i]-'a']=totnode++,t->child[ch[i]-'a']->num=j++;t=t->child[ch[i]-'a'];}t->cnt=1;}
}void make(node *rot,int left,int right) {//printf("%d ",rot->num);if (rot->cnt) flag[left][right-1]=1;if (vis[left][rot->num][right]) return ;if (right>=len) return ;vis[left][rot->num][right]=1;if (rot->child[s[right]-'a']) make(rot->child[s[right]-'a'],left,right+1);for (int i=right;i<len;i++) if (flag[right][i]) make(rot,left,i+1);
}int main() {scanf("%s",s); len=strlen(s);build_trie();for (int i=len-1;i>=0;i--) make(rot,i,i);/*for (int i=0;i<len;i++) {for (int j=0;j<len;j++) printf("%d ",flag[i][j]);printf("\n");}*/w[0]=0;for (int i=0;i<len;i++) {w[i+1]=w[i]+1;for (int j=0;j<=i;j++) if (flag[j][i]) w[i+1]=min(w[i+1],w[j]);//printf("%d ",w[i]);
    }//printf("\n");printf("%d\n",w[len]);return 0;
}