#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "functional"

using namespace std;

//constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-8;

//int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;

int Search(const vector<vector<int>>&edge, vector<int>&num, int node=0) {
	int sz = 0;
	for (int i = 0; i < 27; i++) {
		if (edge[node][i] != -1)num[node] += Search(edge, num, edge[node][i]);
	}
	num[node] = max(num[node], 1);
	return num[node];
}

void Search(const vector<vector<int>>&edge, vector<vector<pair<int, int>>>&nx,const vector<int>&sz ,int node = 0) {
	//cout << "node " << node << endl;
	for (int i = 0; i < 27; i++) {
		int nn = edge[node][i];
		if (nn == -1)continue;
		Search(edge, nx, sz, nn);
		int num = 0;
		for (int j = 0; j < 27; j++) {
			num += edge[nn][j] != -1;
		}
		if (num==1) {
			for (int j = 0; j < 27; j++) {
				if (nx[nn][j].first != -1) {
					nx[node][i] = nx[nn][j];
					nx[node][i].second++;
				}
			}
		}
	}
	return;
}

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

	cin >> N;
	vector<vector<int>>edge(1, vector<int>(27, -1));
	vector<vector<int>>v(N);
	for (int i = 0; i < N; i++) {
		string s;
		cin >> s;
		for (auto j : s) {
			v[i].push_back(j - 'a' + 1);
		}
		v[i].push_back(0);
		int node = 0;
		for (auto j : v[i]) {
			if (edge[node][j] == -1) {
				edge[node][j] = edge.size();
				edge.push_back(vector<int>(27, -1));
			}
			node = edge[node][j];
			//cout << node << endl;
		}
	}
	vector<vector<pair<int, int>>>nx(edge.size(), vector<pair<int, int>>(27, make_pair(-1, -1)));
	vector<int>sz(edge.size());
	for (int i = 0; i < edge.size(); i++) {
		int num = 0;
		for (int j = 0; j < 27; j++) {
			if (edge[i][j] == -1)continue;
			num++;
			nx[i][j] = { edge[i][j],1 };
		}
		if (!num)sz[i] = 1;
	}
	Search(edge, sz);
	Search(edge, nx,sz);
	cin >> K;
	for (int i = 0; i < edge.size(); i++) {
		for (int j = 0; j < 27; j++) {
			//if (nx[i][j].first != -1)cout << i << " " << j << " " << nx[i][j].first << endl;
		}
	}
	while (K--) {
		cin >> M;
		M--;
		string s;
		cin >> s;
		vector<int>w;
		w.push_back(0);
		for (auto i : s)w.push_back(i - 'a' + 1);
		int index = 0;
		int ans = 0;
		int nn = 0;
		while (index < v[M].size()) {
		//	cout << "index " << index << " " << nn << endl;
			for (auto i : w) {
				if (i == v[M][index])break;
				if (edge[nn][i] == -1)continue;
				ans += sz[edge[nn][i]];
			}
			//cout << ans << endl;
			int nnn =  nx[nn][v[M][index]].first;
			int nindex = index+nx[nn][v[M][index]].second;
			index = nindex;
			nn = nnn;
		}
		cout << ans+1 << endl;
	}
}
