#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include<cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)

/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#define PII pair<int,int>
/////////
using namespace::std;

// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
const ULL mod = 1000000007;
vector<ULL> Bpow;

struct hash64{
	vector<unsigned long long> hashVal;
	void set(string &str){
		int size = str.size();
		unsigned long long val=0;
		hashVal.resize(0);
		for(int i=0;i<size;++i){
			val = val * mod + str[i];
			hashVal.push_back( val );
		}
	}
	void makeBpow(int n){
		Bpow.resize(n);
		Bpow[0] = 1;
		for(int i=1;i<n;++i){
			Bpow[i] = Bpow[i-1] * mod;
		}
	}

	unsigned long long getHash(int pos,int size){
		if( pos - 1 < 0 ){
return hashVal[pos+size-1];
		}
return hashVal[pos+size-1] - hashVal[pos-1] * Bpow[size];
	}
};

inline void solve(){
	string str,pat;
	cin >> str;//調べる対象
	hash64 A,B;
	int Asize,Bsize;
	Asize = str.size();
	A.makeBpow( Asize );
	A.set(str);
	int M;
	cin >> M;
	int ans = 0;//25*10**(4+3)
	
	ULL Bhash;
	for(int i=0;i<M;++i){
		cin >> pat;//
		Bsize = pat.size();
		B.set(pat);
		Bhash = B.getHash(0,Bsize);
		for(int j=0;j<Asize-Bsize+1;++j){
			if( Bhash == A.getHash(j,Bsize) ){
				++ans;
			}
		}
	}
	cout << ans << endl;
}

int main(void){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
	//std::cout << std::fixed;//小数を10進数表示
    //cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();

	return 0;
}