#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "abc2";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;

const int INF = (1LL << 31) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int MOD = (1e5) + 3;

int N, M, sol;
char S[(int)(1e7) + 5];
char W[25];
unordered_set<int> H;

int main() {
    int i, s, p;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%s", S);

    while(scanf("%s", W) + 1) {
        if(!N)
            N = strlen(W);

        s = 0;

        for(i = 0; i < N; i++)
            s = (s * 3 + W[i] - 'a') % MOD;

        H.insert(s);
    }

    M = strlen(S);

    for(i = s = 0, p = 1; i < N; i++) {
        s = (s * 3 + S[i] - 'a') % MOD;
        p = (p * 3) % MOD;
    }

    sol += H.count(s);

    for(; i < M; i++) {
        s = (s * 3 - p * (S[i - N] - 'a') + S[i] - 'a' + MOD) % MOD;
        sol += H.count(s);
    }

    printf("%d\n", sol);

    return 0;
}