#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 5e6 + 10;

char v[N];
void solve()
{
    cin.getline(v, N - 5);
    multiset <string> st;
    string V = string(v);
    int n = V.size();
    string tmp;
    for(int i = 0; i < n; i++) {
        if(V[i] <= 'Z' && V[i] >= 'A') {
            V[i] += 32;
            tmp += V[i];
        }
        else if(V[i] <= 'z' && V[i] >= 'a') {
            tmp += V[i];
        }
        else {
            if(tmp.size()) st.insert(tmp);
            tmp = "";
        }
    }

    map <string, int> mp;
    if(tmp.size()) st.insert(tmp);
    auto cnt = st.size();
    int m;
    cin >> m;
    for(int i = 1; i <= m; i++) {
        cin >> tmp;
        if(!mp.count(tmp))
        cnt -= st.count(tmp);
        mp[tmp] = 1;
    }
    cout << cnt;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}