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()
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(Console.OpenStandardInput());
    }
    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 Sc;

    private string S;
    private int M;
    private string[] C;
    Dictionary<char, int> D;
    const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    private void Scan()
    {
        Sc = new Scanner();
        S = Sc.Next();
        M = Sc.NextInt();
        C = new string[M];
        for (int i = 0; i < M; i++)
        {
            C[i] = Sc.Next();
        }
    }

    private long ToLong(string s)
    {
        long result = 0;
        long l = 1;
        foreach (char c in s)
        {
            result += D[c] * l;
            l *= 27;
        }
        return result;
    }

    public void Solve()
    {
        Scan();
        D = new Dictionary<char, int>();
        for (int i = 0; i < 26; i++)
        {
            D.Add(ABC[i], i+1);
        }
        long count = 0;
        foreach (string s in C)
        {
            long search = ToLong(s);
            long l = 0;
            long p = 1;

            for (int i = 0; i < S.Length; i++)
            {
                if (i < s.Length)
                {
                    l += D[S[i]] * p;
                    p *= 27;
                }
                else
                {
                    l /= 27;
                    l += D[S[i]] * p;
                }
                if (i == s.Length - 1)
                {
                    p /= 27;
                }
                if (search == l)
                {
                    count++;
                }
            }
        }
        Console.WriteLine(count);

    }
}