#include<unordered_map>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#define M1 24
#define B1 17
using namespace std;
fstream fin("abc2.in",ios::in),fout("abc2.out",ios::out);
int ind=1,ls,ls1,r=0;
unsigned int k1,p=1;
vector<unsigned int> v;
string s,s1;
inline void cauta(unsigned int val)
{
    int i,step,ls=v.size()-1;
    for (step = 1; step <= ls; step <<= 1);
    for (i = 0; step; step >>= 1)
        if (i + step <= ls && v[i + step] <= val)
           i += step;

    r+=(v[i]==val);
}
int main()
{
    int i,j,c;
    fin>>s;ls=s.size();
    while(fin>>s1)
    {
        ls1=s1.size();
        k1=0;
        for(j=0;j<ls1;j++)
        {
            c=(s1[j]-'a');
            k1=k1+k1+k1+c;
        }
        v.push_back(k1);
    }
    sort(v.begin(),v.end());
    k1=0;
    if(ls1<=ls)
    {
        for(i=0;i<ls1;i++)
        {
            if(i>0) p=p*3;
            c=(s[i]-'a');
            k1=k1+k1+k1+c;
        }
        cauta(k1);
        for(i=ls1;i<ls;i++)
        {
            c=(s[i]-'a');
            while(k1>=p) k1=k1-p;
            k1=k1+k1+k1+c;
            cauta(k1);
        }

    }
    fout<<r;
}