#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#define rap(i, a, n) for(int i=a; i<=n; i++)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define lap(i, a, n) for(int i=n; i>=a; i--)
#define lep(i, a, n) for(int i=n; i>a; i--)
#define MOD 2018
#define LL long long
#define ULL unsigned long long
#define Pair pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define _  ios_base::sync_with_stdio(0),cin->tie(0)
//freopen("1->txt", "r", stdin);
using namespace std;
const int maxn = 26, INF = 0x7fffffff;
char s[21];
struct node
{int num;int id;node *next[maxn];node(){num = id = 0;mem(next, 0);}
}rt;void build(char *a, int id)
{int k = 0;node *p = &rt;while(a[k]){// int x = a[k++] - 'a';if(!p->next[a[k] - 'a']) p->next[a[k] - 'a'] = new node;p = p->next[a[k++] - 'a'];if(p->id != id)p->num++;p->id = id;}
}int qp(char *a)
{int k = 0;node *p = &rt;//  int x = a[k] - 'a';while(a[k] && p->next[a[k] - 'a']) p = p->next[a[k++] - 'a'];if(a[k]) return 0;return p->num;
}int main()
{//  init();int n;scanf("%d", &n);rap(i, 1, n){cin>> s;int len = strlen(s);rep(j, 0, len){build(s+j, i);}}int m;scanf("%d", &m);rap(i, 1, m){cin>> s;printf("%d\n", qp(s));}return 0;
}

#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#define rap(i, a, n) for(int i=a; i<=n; i++)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define lap(i, a, n) for(int i=n; i>=a; i--)
#define lep(i, a, n) for(int i=n; i>a; i--)
#define MOD 2018
#define LL long long
#define ULL unsigned long long
#define Pair pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define _  ios_base::sync_with_stdio(0),cin.tie(0)
//freopen("1.txt", "r", stdin);
using namespace std;
const int maxn = 10001, INF = 0x7fffffff;
int trie[maxn*50][26], sum[maxn*50], id[maxn*50];
int rt, tot;
char s[21];
void build(char* ss, int p)
{int len = strlen(ss);rt = 0;for(int i=0; i<len; i++){int x = ss[i] - 'a';if(trie[rt][x] == 0){trie[rt][x] = ++tot;}rt = trie[rt][x];if(id[rt] != p)sum[rt]++;id[rt] = p;}//sum[rt]++;
}int qp()
{int len = strlen(s);rt = 0;for(int i=0; i<len; i++){int x = s[i] - 'a';if(trie[rt][x] == 0) return 0;rt = trie[rt][x];}return sum[rt];
}void init()
{mem(trie, 0);mem(sum, 0);mem(id, 0);tot = 0;
}int main()
{init();int n;scanf("%d", &n);rap(i, 1, n){cin>> s;int len = strlen(s);rep(j, 0, len){build(s+j, i);//       cout<< "                     " << s+j <<endl;
        }}int m;scanf("%d", &m);rap(i, 1, m){cin>> s;printf("%d\n", qp());}return 0;
}