#include <fstream>
#include <unordered_set>

using namespace std;

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

#pragma GCC optimize("Ofast")

const int base = 3, mod = 1000007;
int ans;
string s, cuv;
unordered_set <unsigned int> dictionar[mod];
int len, s_len;
unsigned int base_pow, modh;

int main()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
    fin >> s;
    s_len = s.size();
    while(fin >> cuv)
    {
        len = cuv.size();
        unsigned int myHash = 0;
        for(int i = 0; i < len; i++)
            myHash = myHash * base + (cuv[i] - 'a');
        modh = myHash % mod;
        if(dictionar[modh].count(myHash) == 0)
            dictionar[modh].insert(myHash);
    }
    base_pow = 1;
    for(int i = 1; i < len; i++)
        base_pow *= base;
    unsigned int myHash = 0;
    for(int i = 0; i < len; i++)
        myHash = myHash * base + (s[i] - 'a');
    modh = myHash % mod;
    if(dictionar[modh].count(myHash))
        ans++;
    for(int i = len; i < s_len; i++)
    {
        int val = s[i - len] - 'a';
        myHash = myHash - base_pow * val ;
        myHash = myHash * base + (s[i] - 'a');
        modh = myHash % mod;
        if(dictionar[modh].count(myHash))
            ans++;
    }
    fout << ans;
    return 0;
}