#include <cstdio>
#include <cmath>

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void swap(T &x, T &y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T &a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T &a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int m;
char s[50001];
char c[5000][11];
int ans;

int main() {
	scanf("%s%d", s, &m);
	inc(i, m) { scanf("%s", c[i]); }
	
	int len = 0;
	while(s[len] != '\0') { len++; }
	
	int test = 0;
	
	inc(i, m) {
		inc(j, len) {
			int k = 0;
			bool flag = true;
			while(c[i][k] != '\0') {
				if(test++ > 250000000) { return 1; }
				if(s[j + k] != c[i][k]) { flag = false; break; }
				k++;
			}
			if(flag) { ans++; }
		}
	}
	
	printf("%d\n", ans);
	
	return 0;
}