#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 <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 2000000000000000000LL
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)
int fail[2000000];
string p;
void construct(string s) {
	s.push_back(' ');
	REP(i, s.length() + 1) {
		fail[i] = -1;
	}
	p = s;
	for (int i = 0, j = -1; i < s.length()-1; ++i) {
		while (j >= 0 && s[i] != s[j]) j = fail[j];
		j++;
		if (s[i + 1] == s[j]) fail[i + 1] = fail[j];
		else fail[i + 1] = j;
	}
}
vector<int> match(string s) {
	vector<int> res;
	for (int i = 0, k = 0; i < s.length(); ++i) {
		while (k >= 0 && s[i] != p[k]) k = fail[k];
		k++;
		if (k == p.length() - 1) res.push_back(i - p.length());
	}
	return res;
}
int main() {
	string s;
	cin >> s;
	int n;
	cin >> n;
	int ans = 0;
	REP(i, n) {
		string a;
		cin >> a;
		construct(a);
		ans += match(s).size();
	}
	cout << ans << endl;
}