#include <iostream>
#include <fstream>
#include <algorithm>
#include <set>
#define DN 50005
using namespace std;

typedef set<string>::iterator it;

int main()
{

    string sir, cuv,caut;
    set<string> s;
    ifstream f("abc2.in");
    ofstream g("abc2.out");
    int n=0,sol=0;
    getline(f,sir);
    for(;0==f.eof();) if(f.good()) {
        getline(f,cuv);
        if(0==cuv.empty()) s.insert(cuv);
    }
    int sz=(*s.begin()).size();
    int lim=sir.size()-sz;
    it c;
    for (int i=0; i<=lim; ++i) {
        caut.erase(0,sz+1);
        for(int j=i; j<=i+sz-1; ++j) caut+=sir[j];
        c=s.find(caut);
        if(c!=s.end()) ++sol;
    }
    g<<sol;
    return 0;
}