#include <bits/stdc++.h>
using namespace std;

string text, word;
map<deque<char>, bool> m;

int main() {
    ifstream cin("abc2.in");
    ofstream cout("abc2.out");
    cin >> text;
    while (cin >> word) {
        deque<char> dq;
        for (int i = 0; i < word.size(); ++i) {
            dq.push_back(word[i]);
        }
        m[dq] = true;
    }
    int ans = 0;
    deque<char> dq;
    for (int i = 0; i < text.size(); ++i) {
        dq.push_back(text[i]);
        if (dq.size() == word.size()) {
            if (m.find(dq) != m.end() && m[dq] == 1) {
                ans += m[dq];
            }
            dq.pop_front();
        }
    }
    cout << ans;
}