#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> Pr;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
// #define mid ((l+r)>>1)
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
string S;

ll n; 
unordered_map<string, int> mp;
void procedure(){
	getline(cin, S);
	for(int i=0;i<S.size();i++){
		if(S[i]>='A' && S[i]<='Z')
			S[i] += 'a'-'A';
		if(S[i]==',' || S[i]=='.' || S[i]=='!' || S[i]=='?')
			S[i] = ' ';
	}
	// cout<<S<<endl;
	stringstream Q;
	Q << S;

	cin>>n; string tmp;
	for(ll i=1;i<=n;i++) cin>>tmp, mp[tmp]=1;

	int cnt = 0;
	
	while(Q >> tmp){
		// cout<<tmp<<endl;
		if(!mp.count(tmp)) cnt ++, mp[tmp] = 1;
	}

	printf("%d\n", cnt);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}