#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

int a[128];

int main(void) {
    int m;
    string s;
    cin >> s >> m;
    int ans = 0;
    while (m--) {
        string t;
        cin >> t;
        int i;
        REP (i,128) a[i] = (1 << t.size()) - 1;
        REP (i,t.size()) {
            a[t[i]] ^= 1 << i;
        }
        int x = (1 << t.size()) - 1;
        for (auto c: s) {
            x = (x << 1) | a[c];
            if ((x & 1 << t.size() - 1) == 0) ans++;
        }
    }
    cout << ans << endl;
    return 0;
}