#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define MT make_tuple
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()

int main() {

	string S;
	cin >> S;

	int N = S.length();

	int M;
	cin >> M;

	VS C(M);
	REP(i, M) cin >> C[i];

	LL ret = 0;
	REP(i, M){
		REP(j, N){
			int n = C[i].length();
			if(j + n > N) break;
			bool ok = true;
			REP(k, n){
				if(S[j + k] != C[i][k]){
					ok = false;
					break;
				}
			}
			if(ok) ret++;
		}
	}

	cout << ret << endl;

	return 0;
}