#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define LONGINF 1000000000000000000
vector<string> hoge;
int main() {
	ios::sync_with_stdio(false);
	string s;
	cin >> s;
	int kazu;
	cin >> kazu;
	REP(i, kazu) {
		string aaa;
		cin >> aaa;
		hoge.push_back(aaa);
	}
	sort(hoge.begin(), hoge.end());
	vector<char> calc;
	for (int i = 0;i < kazu;++i) {
		calc.push_back(hoge[i][0]);
	}
	int ans = 0;
	for (int i = 0;i < s.length();++i) {
		auto it1 = lower_bound(calc.begin(), calc.end(), s[i]);
		int sizei = it1 - calc.begin();
		for (auto j = hoge.begin() + sizei;j < hoge.end();++j) {
			string ppp = *j;
			if (ppp[0] != s[i]||i+ppp.length()-1 >= s.length()) goto done;
			for (int q = 1;q < ppp.length();++q) {
				if (ppp[q] != s[i + q]) goto failed;
			}
			ans++;
		failed:;
		}
	done:;
	}
	cout << ans << endl;
	return 0;
}