#include <bits/stdc++.h>
#define ll long long
using namespace std;
/* 
#define cin fi
#define cout fo
ifstream fi("abc2.in");
ofstream fo("abc2.out");*/
 
const int baza = 3;
const int MOD = 999983;
const int MOD2 = 999979;

int n, m;
char A[10000005];
char a[25];
vector <int> M[MOD];

inline int getMod(long long &x, int M)
{
    return x - x / M * M;
}

void baga(long long x)
{
    int grup = getMod(x, MOD);
    int cod = getMod(x, MOD2);

    bool gasit = 0;
    for (auto da: M[grup])
        if (da == cod)
            gasit = 1;

    if (!gasit)
        M[grup].push_back(cod);
}

bool este(long long x)
{
    int grup = getMod(x, MOD);
    int cod = getMod(x, MOD2);

    for (auto da: M[grup])
        if (da == cod)
            return 1;
    
    return 0;
}
 
signed main()
{
    FILE *fi, *fo;
    fi = fopen("abc2.in", "r");
    fo = fopen("abc2.out", "w");

    fgets(A + 1, 10000000, fi);
    n = strlen(A + 1);
    if (A[n] == '\n')
        n--;
 
    while (fgets(a + 1, 30, fi))
    {
        m = strlen(a + 1);
        if (a[m] == '\n')
            m--;

        long long cod = 0;
        for (int i = 1; i <= m; i++)
        {
            cod = 1LL * cod * baza + 1LL * (a[i] - 'a');
        }
        baga(cod);
    }
 
    if (n < m)
    {
        fprintf(fo, "0");
        return 0;
    }
 
    int rez = 0;
 
    long long p = 1;
    for (int i = 1; i < m; i++)
        p *= baza;
 
    long long cod = 0;
    for (int i = 1; i <= m; i++)
    {
        cod = cod * baza + (A[i] - 'a');
    }
 
    if (este(cod))
        rez++;
 
    for (int i = m + 1; i <= n; i++)
    {
        cod -= p * (A[i - m] - 'a');
        cod = cod * baza + (A[i] - 'a');
 
        if (este(cod))
            rez++;
    }
 
    fprintf(fo, "%d", rez);
 
    return 0;
}