def rolling_hash2(S, s, b=10, mod=10**9+7, d='a'):
    if d == 'a':
        d = {chr(i): i - 97 for i in range(97,123)}
    elif d == 'A':
        d = {chr(i): i - 65 for i in range(65,91)}
    
    n = len(s)
    h = sum([d[S[i]]*pow(b,n-i-1,mod) for i in range(n)]) % mod
    h0 = sum([d[s[i]]*pow(b,n-i-1,mod) for i in range(n)]) % mod
    if h == h0: res = 1
    else: res = 0
    for i in range(1,len(S)-n+1):
        h -= d[S[i-1]]*b**(n-1)
        h *= b
        h += d[S[i+n-1]]
        h %= mod
        if h == h0:
            res += 1
    
    return res

S = input()
M = int(input())
ans = 0
for i in range(M):
  s = input()
  if len(s)==1:
    ans += S.count(s)
  else:
    ans += rolling_hash2(S,s,d='A')
    
print(ans)