#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <map>

using namespace std;

const int LEN = 5;

int main() {
	string s;
	cin >> s;

	int m;
	cin >> m;
	vector<string> c(m);
	for (int i = 0; i < m; i++) {
		cin >> c[i];
	}

	vector<map<string, vector<int>>> subs(6);
	for (int i = 0; i < s.size(); i++) {
		for (int j = 1; j <= 5; j++) {
			auto t = s.substr(i, j);
			if (t.size() == j) {
				subs[j][t].emplace_back(i);
			}
		}
	}

	long long ans = 0;
	for (auto t: c) {
		int t_len = t.size();
		if (t_len <= 5) {
			ans += subs[t_len][t].size();
			continue;
		}

		// t = u + v
		string v = t.substr(LEN);
		int v_len = v.size();
		if (subs[v_len][v].empty()) {
			continue;
		}

		string u = t.substr(0, LEN);

		auto u_pos = subs[LEN][u];
		auto v_pos = subs[v_len][v];
		for (auto x: u_pos) {
			int y = x + LEN;
			if (binary_search(v_pos.begin(), v_pos.end(), y)) {
				ans++;
			}
		}
	}

	cout << ans << endl;
}