#define _CRT_SECURE_NO_WARNINGS
#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<random>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())







int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	string s;
	cin >> s;
	vector<long long> v;
	long long a = 0;
	rep(i, min<int>(10, s.size()))a |= (long long)(s[i] - 'A' + 1) << (9 - i) * 5;
	v.push_back(a);
	for (int i = 10; i < s.size(); i++) {
		a = (a << 5 | s[i] - 'A' + 1)&((1LL << 50) - 1);
		v.push_back(a);
	}
	for (int i = max(1, (int)s.size()-9); i < s.size(); i++) {
		a = (a << 5)&((1LL << 50) - 1);
		v.push_back(a);
	}
	sort(all(v));
	int m;
	cin >> m;
	int ans = 0;
	rep(i,m) {
		string c;
		cin >> c;
		a = 0;
		rep(i, c.size())
			a |= (long long)(c[i] - 'A' + 1) << (9 - i) * 5;
		ans += upper_bound(all(v), a | ((1LL<<5*(10-c.size()))-1) )
			- lower_bound(all(v), a);
	}
	cout << ans << endl;
	return 0;
}