#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

const int MAXV=3e6+5;

struct Node
{
    map<char,int> children;
    int cnt;
};

int n,q;
Node trie[MAXV];
int num=1;

void add(string s)
{
    int cur=0;
    for(int i=0;i<s.size();i++)
    {
        if(trie[cur].children[s[i]]==0) trie[cur].children[s[i]]=num++;
        cur=trie[cur].children[s[i]];
        trie[cur].cnt++;
    }
    int ptr=0;
    int sz=s.size();
    while(ptr<sz-ptr-1 && s[ptr]==s[sz-ptr-1]) ptr++;
    if(ptr>=sz-ptr-1) return;
    cur=0;
    for(int i=s.size()-1;i>sz-1-ptr;i--) cur=trie[cur].children[s[i]];
    for(int i=s.size()-1-ptr;i>=0;i--)
    {
        if(trie[cur].children[s[i]]==0) trie[cur].children[s[i]]=num++;
        cur=trie[cur].children[s[i]];
        trie[cur].cnt++;
    }
}

int query(string s)
{
    int cur=0;
    for(int i=0;i<s.size();i++)
    {
        if(trie[cur].children[s[i]]==0) return 0;
        cur=trie[cur].children[s[i]];
    }
    return trie[cur].cnt;
}

int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

freopen("wordstone.in","r",stdin);
freopen("wordstone.out","w",stdout);

cin>>n;
for(int i=0;i<n;i++)
{
    string s;
    cin>>s;
    add(s);
}

cin>>q;
for(int i=0;i<q;i++)
{
    string s;
    cin>>s;
    int ans=query(s);
    string s1=s;
    reverse(s1.begin(), s1.end());
    if(s!=s1) ans+=query(s1);
    cout<<ans<<endl;
}

return 0;
}