#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 table[11];

int main(void) {
    int i, j, k, m;
    string s;
    cin >> s >> m;
    int ans = 0;
    REP (k,m) {
        string t;
        cin >> t;
        int n = t.size();
        table[0] = table[1] = 0;
        for (i = 2, j = 0; i <= n;) {
            if (t[i-1] == t[j]) {
                table[i] = j + 1;
                i++; j++;
            }
            else if (j > 0) {
                j = table[j];
            }
            else {
                table[i] = 0;
                i++;
            }
        }
        for (i = 0, j = 0; i < s.size();) {
            if (s[i] == t[j]) {
                i++; j++;
                if (j == n) {
                    j = table[j];
                    ans++;
                }
            }
            else if (j > 0) {
                j = table[j];
            }
            else {
                i++;
            }
        }
    }
    cout << ans << endl;
    return 0;
}