#include <iostream.h>

struct utl
{
    unsigned long g1;
    unsigned short g2;
};

struct slt
{
    unsigned short num;
    slt *p,*n;
};

inline void chang(utl &s,char str[])
{

    unsigned short i(0),t0;
    slt *p,*q,*f,*l;
    s.g1=0;
    s.g2=0;
    p=new slt;
    p->n=p;
    p->p=p;
    l=f=p;
    t0=str[i]-'a'+1;
    if (t0<=0 || t0>26) t0=27;
    p->num=t0;
    i++;
    while(str[i]!='\0')
    {
        q=new slt;
        t0=str[i]-'a'+1;
        if (t0<=0 || t0>26) t0=27;
        q->num=t0;
        p=f;
        while(p->num<t0 && p!=l)
            p=p->n;
        if (p->num<t0)
        {
            p->n=q;
            q->p=p;
            q->n=q;
            l=q;
        }
        else 
        {
            if(p==f)
            {
                q->n=p;
                q->p=q;
                p->p=q;
                f=q;
            }
            else
            {
                q->n=p;
                q->p=p->p;
                p->p->n=q;
                p->p=q;
                
            }
        }
        i++;
    }
    p=f;
    i=i>6?6:i;
    p=f;
    while(p!=l)
    {
        if(i)
        {
            s.g1<<=5;
            s.g1+=p->num;
            i--;
        }
        else
        {
            s.g2<<=5;
            s.g2+=p->num;
        }
        q=p;
        p=p->n;
        delete q;
    }
    if(i)
    {
        s.g1<<=5;
        s.g1+=p->num;
        i--;
        delete p;
    }
    else
    {
        s.g2<<=5;
        s.g2+=p->num;
        delete p;
    }    
}

int main()
{
    utl *see,dir;
    char str[10];
    int m,n,i,sm,j;
    cin>>n;
    see=new utl[n];
    for(i=0;i<n;i++)
    {
        cin>>str;
        chang(see[i],str);
    }
    cin>>m;
    for(i=0;i<m;i++)
    {
        sm=0;
        cin>>str;
        chang(dir,str);
        for(j=0;j<n;j++)
            if (dir.g1==see[j].g1 && dir.g2==see[j].g2)
                sm++;
        cout<<sm<<endl;
    }
    return 0;
}