#include "bits/stdc++.h"
 
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++) 
#define REP(i,n) for(int i = 0;i < (n) ; i++) 
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
//----------------------------------------------------------------

int MOD = 998244353;
// int MOD = 1000000007;

vll table[11];
//----------------------------------------------------------------
signed main(){

	string s;
	ll m;
	cin >> s >> m;
	vector<string> c(m);
	rep(i,m)cin >> c[i];
	
	ll base1 = 29;
	ll M = 1000000007;
	for(int num = 1;num <= min(10LL,(ll)s.size());num++){
		ll h1 = 0;
		ll pow = 1;
		for(ll k = num-1;k>=0;k--){
			h1 = (h1+(s[k]-'A')*pow%M)%M;
			pow = (pow*base1)%M;
		}
		table[num].pb(h1);
		for(int i = 1;i <= (ll)s.size()-num;i++){
			ll h2 = table[num][i-1];
			h2 = (h2*base1%M-(s[i-1]-'A')*pow%M+(s[i+num-1]-'A')+M)%M;
			table[num].pb(h2);
		}
	}

	ll cnt = 0;
	rep(i,m){
		ll n = c[i].size();
		ll h1 = 0;
		ll pow = 1;
		for(ll k = n-1;k>=0;k--){
			h1 = (h1+(c[i][k]-'A')*pow%M)%M;
			pow = (pow*base1)%M;
		}
		rep(j,table[n].size()){
			if(table[n][j] == h1)cnt++;
		}
	}
	cout << cnt << endl;
	




	return 0;
}

//----------------------------------------------------------------

// g++ -std=c++14 code1.cpp
// sudo pip3 install --upgrade online-judge-tools
// rm -r -f test;oj dl https://code-festival-2018-quala.contest.atcoder.jp/tasks/code_festival_2018_quala_c
// rm -r -f test;oj dl https://ddcc2017-final.contest.atcoder.jp/tasks/ddcc2017_final_b
// rm -r -f test;oj dl https://agc038.contest.atcoder.jp/tasks/agc038_a