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_ini(t):
        h = 0
        p = 1
        for i in range(1, len(t) + 1):
            hash_table[i] = h = (h * base + t[i - 1]) % hash_md
            pw[i] = p = p * base % hash_md

    def hash(s):
        res = 0
        for i, c in enumerate(s[::-1]):
            res = (res + pw[i] * (ord(c) - ord_a)) % hash_md
        return res

    # インデックスがi以上j未満の文字列のハッシュ
    def hash_ij(i, j):
        return (hash_table[j] - hash_table[i] * pw[j - i]) % hash_md

    s=SI()

    # こっから本体
    base = 31
    hash_md = pow(3, 37)
    ord_a = ord('a')
    s = [ord(c) - ord_a for c in s]
    hash_table = [0] * (len(s) + 1)
    pw = [1] * (len(s) + 1)
    hash_ini(s)

    ans=0
    for _ in range(II()):
        t=SI()
        p=hash(t)
        for i in range(len(s) - len(t) + 1):
            if hash_ij(i, i + len(t)) == p:ans+=1
    print(ans)

main()