using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{
    static void Main(string[] args)
    {
        new Magatro().Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;

    private string[] S;
    private int Index;
    private const char Separator = ' ';

    public Scanner(Stream source)
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(source);
    }

    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }

    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public decimal NextDecimal()
    {
        return decimal.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{
    private Scanner Cin;
    private string S;
    private int M;
    private string[] C;
    const int AlphabetNum = 26;

    private void Scan()
    {
        Cin = new Scanner(Console.OpenStandardInput());
        S = Cin.Next();
        M = Cin.NextInt();
        C = new string[M];
        for (int i = 0; i < M; i++)
        {
            C[i] = Cin.Next();
        }
    }

    public void Solve()
    {
        Scan();

        int anser = 0;
        foreach (string s in C)
        {
            anser += Count(s);
        }
        Console.WriteLine(anser);
    }

    private int Count(string s)
    {
        long search = 0;
        search = ToLong(s);
        long hash = 0;
        long digi = 1;
        for (int i = 0; i < s.Length - 1; i++)
        {
            hash += Map(S[i]) * digi;
            digi *= AlphabetNum;
        }

        int result = 0;

        for (int i = s.Length - 1; i < S.Length; i++)
        {
            hash += Map(S[i]) * digi;
            if (hash == search) result++;
            hash /= AlphabetNum;
        }

        return result;
    }

    private long ToLong(string s)
    {
        long result = 0;
        long digi = 1;
        for (int i = 0; i < s.Length; i++)
        {
            result += Map(s[i]) * digi;
            digi *= AlphabetNum;
        }
        return result;
    }

    private int Map(char c)
    {
        return c - 65;
    }
}