#include <bits/stdc++.h>
using namespace std;

ifstream fin("abc2.in");
ofstream fout("abc2.out");

const int BASE = 3;
unsigned int getHashCode(string str) {
    unsigned int h = 0;
    for (int i = 0; i < (int) str.size(); i++)
        h = h * BASE + (str[i] - 'a');
    return h;
}

int main() {
    string str; fin >> str;
    vector<unsigned int> patterns; int len = 0;

    string pattern;
    while (fin >> pattern) {
        len = pattern.size();
        patterns.push_back(getHashCode(pattern));
    }
    sort(patterns.begin(), patterns.end());

    unsigned int h = getHashCode(str.substr(0, len));
    int sol = binary_search(patterns.begin(), patterns.end(), h);

    unsigned int pwr = 1;
    for (int i = 1; i < len; i++)
        pwr *= BASE;
    
    auto find = [&](unsigned int val) {
        int lo = -1, hi = patterns.size();
        while (hi - lo > 1) {
            int md = (lo + hi) >> 1;
            if (patterns[md] < val)
                lo = md;
            else
                hi = md;
        }
        return 0 <= hi && hi < (int) patterns.size() && patterns[hi] == val;
    };

    for (int i = len; i < (int) str.size(); i++) {
        h = (h - (str[i - len] - 'a') * pwr) * BASE + (str[i] - 'a');
        sol += find(h);
    }
    fout << sol << '\n';

    fout.close();
    return 0;
}