//
// Created by THINKPAD on 2024/11/11.
//
#include <bits/stdc++.h>
using namespace std;
const int S=6000006;
int n,tot;
map<int, char> ch[S];
char a[S],b[22],c[S];
bool is[S];
void insert() {
    int p=0;
    for (int i=0;b[i];++i) {
        if (!ch[p][b[i]]) {
            ch[p][b[i]] = ++tot;
        }
        p = ch[p][b[i]];
    }
    is[p] = true;
}
bool pd() {
    bool ret = false;
    int p=0;
    for (int i=0;c[i];++i) {
        if (!ch[p][c[i]]) {
            ch[p][c[i]] = ++tot;
        }
        p = ch[p][c[i]];
    }
    if (!is[p]) ret = true;
    is[p] = true;
    return ret;
}
int main() {
    int len = 0;
    for (char c = getchar(); c!='\n'; c=getchar())
        a[len++] = c;
    a[len] = 0;
    for (int i=0;a[i];++i) {
        if (a[i]>='A' && a[i]<='Z') {
            a[i]=a[i]-'A'+'a';
        } else if (a[i]<'a' || a[i]>'z') {
            a[i]=' ';
        }
    }
    scanf("%d",&n);
    for (int i=1;i<=n;++i) {
        scanf("%s",b);
        insert();
    }
    int res=0,id = 0;
    while (id < len && sscanf(a + id,"%s",c)) {
        bool flag = true;
        for (int i=0;c[i];++i)
            if (c[i]>='a' && c[i]<='z') flag = false;
        //printf("%d %s\n",n,c);
        if (!flag && pd()) {
            ++res;
        }
        id += strlen(c) + 1;
    }
    printf("%d\n",res);
    return 0;
}