#include <fstream>
#include<vector>
#include<cstring>
#define prim 30031
using namespace std;

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

char text[10000002], word[23];
vector<long> Hash[prim];
int n, m, match = 0;
long long pow3[24], cod;


int main()
{
    pow3[0] = 1;
    for(int i = 1; i<=22; ++i) pow3[i] = pow3[i-1]*3;


    cin>>text;
    m = strlen(text);

    while(cin>>(word))
    {
        n = strlen(word);
        cod = 0;
        for(int i = 0; i<n; ++i){
            cod += (word[i] - 'a')*pow3[i];
        }
        Hash[cod%prim].push_back(cod);
    }
    cod = 0;




    for(int i = 0; i<n; ++i){
        cod+=(text[i] - 'a')*pow3[i];
    }


    for(int i = n; i<m; ++i){
        int key = cod%prim;
        int dim = Hash[key].size();
        for(int j = 0; j<dim; ++j){
            if(Hash[key][j]==cod){
            match++;
            break;
            }
        }
        cod/=3;
        cod+=pow3[n-1]*(text[i]-'a');
    }
        int key = cod%prim;
        int dim = Hash[key].size();
        for(int j = 0; j<dim; ++j){
            if(Hash[key][j]==cod){
            match++;
            break;
            }
        }

    cout<<match;

    return 0;
}