/*
    Worg
*/
#include <cstdio>
#include <vector>
#include <cstring>

#define MOD 1000003
#define MOD_2 666013
#define DIM 10000010
#define sigma 5

using namespace std;
FILE *fin = freopen("abc2.in","r",stdin);
FILE *fout = freopen("abc2.out","w",stdout);

vector <int> Hash[ MOD ];
char T[ DIM ], F[ 30 ];
int len_1, len_2;
long long int x1, x2, rest_1;

inline int val( char x )
{
    return (int) x - 'a';
}

inline void giveValues()
{
    x1 = 0;
    for(int i = 0; i < len_2; ++i)
    {
        x1 = (x1 * sigma + val( F[i] ));
    }
}

inline bool Find(int q1)
{
    int q2 = q1 % MOD;
    for(int i = 0; i < Hash[q1].size(); ++i)
        if( Hash[q1][i] == q2 )
            return 1;
    return 0;
}

void Read()
{
    gets( T );
    len_1 = strlen( T );
    while( gets(F) )
    {
        len_2 = strlen( F );
        giveValues();
        Hash[x1 % MOD].push_back(x1);
    }
}

void Solve()
{
    int i, q1 = 0, ans = 0;

    rest_1 = sigma;
    for(i = 0; i < len_2; ++i)
    {
        q1 = (q1 * sigma + val( T[i] ) );
        if( i )
            rest_1 = (rest_1 * sigma);
    }
    ans += Find(q1);

    for(i = len_2; i < len_1; ++i)
    {
        q1 = (q1 * sigma + val( T[i] ) );
        q1 -= val( T[i - len_2] ) * rest_1;

        ans += Find(q1);
    }
    printf("%d", ans);
}

int main()
{
    Read();
    if( len_2 > len_1 )
    {
        printf("0");
        return 0;
    }
    Solve();
    return 0;
}