#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
//#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {if (a > b) a = b;}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {if (a < b) a = b;}
void fail() { cout << -1 << endl; exit(0); }

typedef pair<int, int> pii; typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 998244353;
constexpr int MAX = 3030;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1; constexpr int INF = 1e9 + 1;
//const int dx[4] = { 0,0,-1,1 }, dy[4] = { 1,-1,0,0 };


struct Trie {
	bool f;
	bool isend;
	Trie *par;
	Trie *next[26];
	int siz;
	Trie() { isend = false; siz = 1; f = 0; par = (Trie*)0; fill(next, next + 26, (Trie*)0); }
};

Trie *ins(string t, Trie *r) {
	for (int i = 0; i < t.size(); i++) {
		int c = t[i] - 'a';
		if (!r->next[c])r->next[c] = new Trie;
		r->next[c]->par = r;
		r = r->next[c];
		r->f = 1;
		if (i == (int)t.size() - 1)r->isend = true;
	}
	return r;
}
Trie* rs[100020];
int dfs(Trie *r) {
	int res = 0;
	if (r->isend)res = 1;
	REP(i, 26) {
		if (r->next[i]) {
			res += dfs(r->next[i]);
		}
	}
	r->siz = res;
	return res;
}
string S[100010];
int cnt[100010][26][26];
int ans[100010];
void calc(int id,int idx,Trie *r) {
	if (idx < 0)return;
	int num = S[id][idx] - 'a';

	if (r->isend) {
		ans[id]++;
		//REP(i, 26)REP(j, 26)cnt[id][i][j]++;
	}
	REP(i, 26) {
		//if (i == num)continue;
		
		if (r->next[i]) {
			cnt[id][i][num] += r->next[i]->siz;
		}
	}
	if (!r->par)return;
	calc(id, idx - 1, r->par);

}
void check(Trie *r, string s) {
	cerr << "string:" << s << endl;
	cerr << "size:" << r->siz << endl;
	REP(i, 26) {
		if (r->next[i])check(r->next[i], s+(char)(i+'a'));
	}
}
void solve() {
	Trie* r = new Trie();
	int N; cin >> N;
	REP(i, N) {
		cin >> S[i];
		//while (r->par)r = r->par;
		rs[i]=ins(S[i], r);
	}
	while (r->par)r = r->par;
	dfs(r);
	//check(r, "");
	//print("a");
	REP(i, N) {
		calc(i, (int)S[i].size()-1, rs[i]->par);
	}
	//print("b");
	int Q; cin >> Q;
	REP(_, Q) {
		int k; cin >> k;
		k--;
		int res = 0;
		string t; cin >> t;
		REP(i, 26) {
			FOR(j, i + 1, 26) {
				res += cnt[k][t[i] - 'a'][t[j] - 'a'];
			}
		}
		print(res+1+ans[k]);
	}
}





signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//mt.seed((int)(time(0)));
	//int q;
	//cin >> q;
	//while (q--)
	solve();
}



Measured memory_bytes: 299320