#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 //#define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
//    int dx[8]={0,1,0,-1,1,1,-1,-1};
  //  int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x;
                                   				int y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                        

                                            class Point{
                                            	public:
                                            	double x,y;
                                            	Point(double x=0,double y=0):x(x),y(y) {}
                                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                            	Point operator * (double a) {return Point(x*a,y*a);}
                                            	Point operator / (double a) {return Point(x/a,y/a);}
                                            	double absv() {return sqrt(norm());}
                                            	double norm() {return x*x+y*y;}
                                            	bool operator < (const Point &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const Point &p) const{
                                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                            	}
                                            };
                                            typedef Point Vector;
                                     #define pl pair<int,pas>
                                            struct Segment{
                                            Point p1,p2;
                                            };
                                             double dot(Vector a,Vector b){
                                            	return a.x*b.x+a.y*b.y;
                                            }
                                            double cross(Vector a,Vector b){
                                            	return a.x*b.y-a.y*b.x;
                                            }
                                        
                bool parareru(Point a,Point b,Point c,Point d){
                //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
                	return abs(cross(a-b,d-c))<EPS;
                }
                double distance_ls_p(Point a, Point b, Point c) {
                  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
                  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
                  return abs(cross(b-a, c-a)) / (b-a).absv();
                }
                bool is_intersected_ls(Segment a,Segment b) {
                	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
                	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
                //		cout<<"sss"<<endl;
                		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
                		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
                		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
                		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
                		return false;
                	}
                  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
                }
                 
                double segment_dis(Segment a,Segment b){
                	if(is_intersected_ls(a,b))return 0;
                	double r=distance_ls_p(a.p1, a.p2, b.p1);
                	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
                	return r;
                }
                Point intersection_ls(Segment a, Segment b) {
                  Point ba = b.p2-b.p1;
                  double d1 = abs(cross(ba, a.p1-b.p1));
                  double d2 = abs(cross(ba, a.p2-b.p1));
                  double t = d1 / (d1 + d2);
                 
                  return a.p1 + (a.p2-a.p1) * t;
                }
                
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==0)return b;
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                                double distans(double x1,double y1,double x2,double y2){
                                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                                	return sqrt(rr);
                                	
                                }
                                int mod;
ll extgcd(ll a, ll b, ll &x, ll &y) {
    if (b == 0ll) {
        x = 1ll;
        y = 0ll;
        return a;
    }
    ll d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
pa operator-(const pa & l,const pa & r) {   
    return {l.first-r.first,l.second-r.second};                                    
} 
                                
                int pr[220010];
                int inv[220010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
    double bekid(double w,int r){
    	if(r==0) return 1.0;
    	if(r==1) return w;
    	if(r%2) return bekid(w,r-1)*w;
    	double f=bekid(w,r/2);
    	return f*f;
    }
                
    			int comb(int nn,int rr){
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<=ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                	inv[ert]=beki(pr[ert],mod-2,mod);
                	
                	for(int i=ert-1;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
                	
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
    //mt19937(clock_per_sec);
  //  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
	   
       
                               //----------------kokomade tenpure------------


int G[100020]={};
string t[100020];
struct aho{
	
	// add_string(文字列, id)で検索パターンを追加 文字列は全部distinct!!
	// shori()で前処理
	// find_string(s) で文字列s内にあるパターンを列挙(YARU内でその処理を書く)
	
	
	
	typedef struct trie{
		int moji;
		int id;
//		int deb;
		trie* parent;
		trie* flink;
		trie* outer;
		trie* child[26];
	}trie;
    private:
    public:
	
	int cd=0;
	trie* new_trie(){
		trie *p = new trie;
		p->id=-1;
//		p->deb=cd;
		cd++;
		p->flink=NULL;
		p->parent=NULL;
		p->outer=NULL;
		for(int i=0;i<26;i++) p->child[i]=NULL;
		return p;
	}
	
	trie* ROOT;
	
	aho(){
		ROOT=new_trie();
		ROOT->moji=-1;
		
	}
	
	void add_string(string str, int str_id){
		int it=0;
		trie* trie_now=ROOT; 
		while(1){
			if(it==str.length()){
				trie_now->id=str_id;
				return;
			}
			int tugi=str[it]-'a'; // komoji
	
			if(trie_now->child[tugi] ==NULL){
				trie* p_new=new_trie();
				p_new->moji= tugi;
				p_new->parent=trie_now;
				trie_now->child[tugi]=p_new;
	
			}
			trie_now=trie_now->child[tugi];
	
			it++;
		}
	}
	
	void debug(){
		debug_dfs(ROOT);
	}
	void debug_dfs(trie* e){
//		cout<<e->deb<<" "<<e->id<<" "<<e->moji<<" ";
//		if(e->flink!=NULL)cout<<e->flink->deb<<" ";
		cout<<"c " ;
		for(int i=0;i<26;i++)if(e->child[i]!=NULL) cout<<i<<" ";
		cout<<endl;
		for(int i=0;i<26;i++)if(e->child[i]!=NULL) debug_dfs(e->child[i]);
		
	}
	
	queue<trie*> queue_trie;
	void shori(){
		ROOT->parent=ROOT;
		ROOT->flink=ROOT;
		queue_trie.push(ROOT);
		while(queue_trie.size()){
			trie* trie_now=queue_trie.front();
			queue_trie.pop();
		
			for(int i=0;i<26;i++)if(trie_now->child[i]!=NULL) queue_trie.push(trie_now->child[i]);
			if(trie_now==ROOT) continue;
			if(trie_now->parent==ROOT){
				trie_now->flink=ROOT;
				continue;
			}
			trie* itr=(trie_now->parent)->flink;
			while(1){
				if(itr==ROOT){
					if(ROOT->child[trie_now->moji] ==NULL){
						trie_now->flink=ROOT;
						break;
					}
					else{
						trie_now->flink=ROOT->child[trie_now->moji];
						break;
					}
				}
				else{
					if(itr->child[trie_now->moji] !=NULL){
						trie_now->flink=itr->child[trie_now->moji];
						break;
					}
					else itr=itr->flink;	
				}
			}
		//cout<<trie_now->deb<<" "<<trie_now->flink->deb<<endl;
		
		}
		
			while(queue_trie.size())queue_trie.pop();
		queue_trie.push(ROOT);
			
		while(queue_trie.size()){
			trie* trie_now=queue_trie.front();
			queue_trie.pop();
			for(int i=0;i<26;i++)if(trie_now->child[i]!=NULL)queue_trie.push(trie_now->child[i]);
			if(trie_now==ROOT) continue;
			if(trie_now->flink->id<0) trie_now->outer=trie_now->flink->outer;
			else{
				trie_now->outer=trie_now->flink;
			}
		}
	
	}

//void shori(int id,int iti);
	void string_find(string str){
		int it=0;
		trie* trie_now=ROOT;
		int l=str.length();
		int moji=str[0]-'a'; // komoji
		while(1){
		
			if(trie_now->id>=0){
				YARU(trie_now->id,it);
			//cout<<trie_now->id<<" "<<it<<endl;
			}
			
			trie* tr=trie_now->outer;
			while(tr!=NULL){
				YARU(tr->id,it);
				tr=tr->outer;
			}
			
			if(moji==-1){
				
				return;
			
			}
			while(trie_now->child[moji]==NULL){
				trie_now=trie_now->flink;
				
				if(trie_now==ROOT) break;
			}
		
			if(trie_now->child[moji]!=NULL){
				trie_now=trie_now->child[moji];
			}
			it++;
			if(it==l) moji=-1;
			else moji=str[it]-'a';
		}	
	}

	void YARU(int id,int iti){
//		cout<<iti<<" "<<id<<endl;
	//	G[iti].pb(id);
		G[iti]=max(G[iti],iti-(int)t[id].length()+1);
//	ans++;	
		//id は文字列番号
		//iti は終了位置

	}

};

aho ss;
priority_queue<pa,vector<pa>,greater<pa>> pq;

signed main(){

		  cin.tie(0);
	ios::sync_with_stdio(false);
	


string s;
	cin>>s;	
	int n;
	cin>>n;	
		
	for(int i=0;i<n;i++){
		cin>>t[i];
		
		ss.add_string(t[i],i);
	}
	ss.shori();
	

	ss.string_find(s);
	int l=s.length();
	
	
	int las=0;
	int ans=0;
	for(int i=1;i<=l;i++){
		//for(auto v:ve[i]){
		//	cout<<i<<" "<<G[i]<<endl;
			if(G[i]){
			pq.push(mp(i,G[i]));
			}
		while(pq.size()){
			if(pq.top().second<=las) pq.pop();
			else break;
		}
		if(pq.size()==0) continue;
		
		if(pq.top().first==i){
		
			las=i;
			ans++;
		}
	}
	cout<<ans<<endl;
	return 0;
}


Measured memory_bytes: 25176