#include<bits/stdc++.h>

using namespace std;

const int maxn=50001;
string g[maxn], gr[maxn];
string h[maxn], hr[maxn];
int lg[maxn], lh[maxn];
int n, q;
void read()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>g[i];
        int sz=g[i].size();
        lg[i]=sz;
        for(int j=0;j<sz;j++)
        {
            gr[i]+=g[i][j];
        }
        g[i]+=(('a'-1));
        reverse(gr[i].begin(), gr[i].end());
        gr[i]+=(('z'+1));
    }
    cin>>q;
    for(int i=1;i<=q;i++)
    {
        cin>>h[i];
        hr[i]=h[i];
        int sz=h[i].size();
        lh[i]=sz;
        h[i]+=(('a'-2));
        reverse(hr[i].begin(), hr[i].end());
        hr[i]+=(('z'+2));
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<q;j++)
        {
            if(lg[i]<lh[j])
            {
                cout<<1/0<<endl;
            }
        }
    }
    sort(g+1, g+n+1);
    sort(gr+1, gr+n+1);
}
/*
int binary(string t1, string t2)
{

    int l1=1, r1=n, m1;
    int l2=1, r2=n, m2;
    while(l1<=r1)
    {
        m1=(l1+r1)/2;
        if(t1<)
    }

}
*/
void solve()
{
    for(int i=1;i<=q;i++)
    {

    }
}

int main()
{
#ifdef ONLINE_JUDGE
    freopen("wordstone.in", "r", stdin);
    freopen("wordstone.out", "w", stdout);
#endif
    read();
    //cout<<1<<endl;
	return 0;
}