#include <iostream>
#include <fstream>
#include <queue>
#include <map>

using namespace std;

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

const int N = 50005;
const int M = 666019;

string initial;

long long int val[N],urm[N],lst[M],nr;

bool apartine(int x)
{
    long long c = x % M;
    for (long long p = lst[c]; p != 0; p = urm[p])
    {
        if (val[p] == x)
        {
            return true;
        }
    }
    return false;
}

void adauga(int x)
{
    int c = x % M;
    if (apartine(x))
    {
        return;
    }
    val[++nr] = x;
    urm[nr] = lst[c];
    lst[c] = nr;
}

int main()
{
    in >> initial;
    string moment;
    int cnt = 0;
    int l;
    while (in >> moment)
    {
        l = moment.length();
        long long has = 0;
        for (int i=0; i<moment.length(); i++)
        {
            has = (has*3LL + (long long int)(moment[i] - 'a'));
        }
        adauga(has);
    }
    long long int has = 0;
    long long int p =1;
    for (int i=0; i<l; i++)
    {
        has = (has*3LL + (long long int)(initial[i] - 'a'));
        if (i != 0)
            p = (p*3LL);
    }
    if (apartine(has)) cnt++;
    for (int i=l; i<initial.length(); i++)
    {
        has = ((has - (long long int)((initial[i-l] - 'a')*p))*3LL + (long long int)(initial[i] - 'a'));
        if (apartine(has)) cnt++;
    }
    out << cnt;
    return 0;
}