from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    def hash(s):
        res = 0
        base=1
        for i, c in enumerate(s[::-1]):
            res += (ord(c)-65)*base
            base*=26
        return res

    s=SI()
    ans=0
    for _ in range(II()):
        t=SI()
        hs=hash(s[:len(t)])
        ht=hash(t)
        mxd=pow(26,len(t)-1)
        for i in range(len(s) - len(t) + 1):
            if i:hs=(hs-mxd*(ord(s[i-1])-65))*26+ord(s[i+len(t)-1])-65
            if hs==ht:ans+=1

    print(ans)

main()