S = input()
M = int(input())
C = []
for i in range(M):
	C.append(input())
print(C)


def search(C, S):
	count = 0
	lenS = len(S)
	lenC = len(C)
	for i in range(lenS - lenC + 1):
		if S[i:i+lenC] == C:
			count += 1
	return count

count = 0
for i in range(M):
	count += search(C[i], S)
print(count)