#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>

#define mp make_pair
#define pb push_back


typedef long long ll;
typedef long double ld;

using namespace std;
const int MAXN = 120000;
const int MX = 450000;

int go[MX][26];
int cc[MX];
int fl[MX];
int nowcc = 1;
int gg[26][26];
int gg2;
int aa2[MAXN];
int aa[MAXN][26][26];
int n,q;

int newn() {
	fl[nowcc] = -1;
	return nowcc++;
}

void add(const string &s, int i) {
	int now = 0;
	for (int i = 0; i < (int)s.size(); ++i) {
		++cc[now];
		if (go[now][s[i] - 'a'])
			now = go[now][s[i] - 'a'];
		else
			now = go[now][s[i] - 'a'] = newn();
	}
	++cc[now];
	fl[now] = i;
}

void dfs1(int v) {
	if (fl[v] != -1) {
		memcpy(aa[fl[v]], gg, sizeof(gg));
		aa2[fl[v]] = gg2;
	}
	if (fl[v] != -1)
		++gg2;

	for (int i = 0; i < 26; ++i) {
		if (go[v][i]) {
			for (int j = 0; j < 26; ++j)
				if (go[v][j] && j != i) {
					gg[i][j] += cc[go[v][j]];
				}
			dfs1(go[v][i]);
			for (int j = 0; j < 26; ++j)
				if (go[v][j] && j != i) {
					gg[i][j] -= cc[go[v][j]];
				}
		}
	}

	if (fl[v] != -1)
		--gg2;
}

void build() {
	dfs1(0);
}
char buf[MX];
string s[MAXN];

int main() {
	scanf("%d", &n);
	fl[0] = -1;
	for (int i = 0; i < n; ++i) {
		scanf(" %s", buf);
		s[i] = buf;
		add(s[i], i);
	}
	build();
	scanf("%d", &q);
	for (int i = 0; i < q; ++i) {
		int k;
		scanf("%d%s", &k, buf);
		--k;
		int ans = 1 + aa2[k];
		for (int j = 0; j < 26; ++j)
			for (int l = j + 1; l < 26; ++l)
				ans += aa[k][buf[l] - 'a'][buf[j] - 'a'];
		printf("%d\n", ans);
	}
	return 0;
}


