#include <fstream>
#include <algorithm>
#include <vector>
#define MOD1 30103
#define MOD2 666013
#define LL long long

using namespace std;

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

int N, M, i, j, ANS;
LL nr1, nr2, P1, P2;
vector <int> Hash[MOD1];
string T, P;

void Check(LL A, LL B)
{
    if (find(Hash[A].begin(), Hash[A].end(), B)!=Hash[A].end())
      ANS++;
}

int main()
{
    fin >> T;
    N=T.size();
    while (fin >> P)
    {
        M=P.size();
        nr1=nr2=0;
        P1=P2=1;
        for (i=M-1; i>=0; i--)
        {
            nr1+=P1*(P[i]-'a');
            nr2+=P2*(P[i]-'a');
            if (i>0)
            {
                P1*=3;
                P2*=3;
            }
        }
        Hash[nr1 % MOD1].push_back(nr2 % MOD2);
    }
    nr1=nr2=0;
    P1=P2=1;
    for (i=M-1; i>=0; i--)
    {
        nr1+=P1*(T[i]-'a');
        nr2+=P2*(T[i]-'a');
        if (i>0)
        {
            P1*=3;
            P2*=3;
        }
    }
    Check(nr1 % MOD1, nr2 % MOD2);
    for (i=M; i<N; i++)
    {
        nr1-=P1*(T[i-M]-'a');
        nr1*=3;
        nr1+=T[i]-'a';
        nr2-=P2*(T[i-M]-'a');
        nr2*=3;
        nr2+=T[i]-'a';
        Check(nr1 % MOD1, nr2 % MOD2);
    }
    fout << ANS << '\n';
    fin.close();
    fout.close();
    return 0;
}