#include <cstdio>
#include <cstring>
#include <queue>
#include <unordered_set>

using namespace std;

const int N = 10000003;
const int H1 = 666013;
const int H2 = 666777;
const int H3 = 1e9 + 7;
const int BAZA1 = 67;
const int BAZA2 = 83;

char s [N];
char d [50003][22];
unordered_set <int> h;
unordered_set <int> :: iterator it;

int main(){
    int n, i, k, a1, a2, a3, ans, powBAZA1, powBAZA2, l, j;

    freopen("abc2.in", "r", stdin);
    freopen("abc2.out", "w", stdout);

    n = 0;
    scanf("%s\n", s);
    while ((scanf("%s", d [++ n]) != EOF));

    if (n == 1) {
        printf("0\n");
        return 0;
    }
    l = strlen(d [1]);
    for (i = 1; i <= n; i++) {
        a1 = a2 = 0;
        for (j = 0; j < l; j++) {
            a1 = (1ll * a1 * BAZA1 % H1 + d [i][j]) % H1;
        }
       // a3 = (1ll * a1 * H2 + a2) % H3;
        it = h.find(a1);
        if (it != h.end()) {
            continue;
        }
        h.insert(a1);
     //   printf ("%d %d\n", a1, a2);
    }

//    printf("\n\n");
    a1 = a2 = 0;
    for (i = 0;s [i] && i < l; i++) {
        a1 = (1ll * a1 * BAZA1 % H1 + s [i]) % H1;
       // a2 = (1ll * a2 * BAZA2 % H2 + s [i]) % H2;
    }
    if (i != l) {
        printf("0\n");
        return 0;
    }

    ans = 0;
    //a3 = (1ll * a1 * H2 + a2) % H3;
    it = h.find(a1);
    if (it != h.end())
        ans++;


    powBAZA1 = powBAZA2 = 1;
    for (i = 1; i < l; i++){
        powBAZA1 = (1ll * powBAZA1 * BAZA1) % H1;
       // powBAZA2 = (1ll * powBAZA2 * BAZA2) % H2;
    }
 //   printf("%d %d\n", a1, a2);

    n = strlen(s);
    for (i = 1; i < n - l; i++){
        a1 = ((a1 - (1ll * s [i - 1] * powBAZA1)% H1) + H1) % H1;
        a1 = (1ll * a1 * BAZA1 % H1 + s [i + l - 1]) % H1;

      /*  a2 = ((a2 - (1ll * s [i - 1] * powBAZA2) % H2) + H2) % H2;
        a2 = (1ll * a2 * BAZA2 % H2 + s [i + l - 1]) % H2;

        a3 = (1ll * a1 * H2 + a2) % H3;*/
    //        printf("%d %d\n", a1, a2);
        it = h.find(a1);
        if (it != h.end())
            ans++;
    }
    printf("%d\n", ans);
    return 0;
}