#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

struct Node {
	int par;
	unsigned char c;
	unsigned char count;
	bool last;
	int last_count = 0;
	int childs[26];
	Node() {
		par = -1;
		c = 60;
		count = 0;
		last = false;
		memset(childs, -1, sizeof(int) * 26);
	}
};

class trie_tree {
public:
	vector<Node> nodes;
	int add_node() {
		nodes.emplace_back();
		return sz(nodes) - 1;
	}

	trie_tree() {
		clear();
	}

	void clear() {
		nodes.clear();
		add_node();
	}

	int add(const char* s) {
		int cur = 0;
		for (int i = 0; s[i]; i++) {
			int nxt = nodes[cur].childs[s[i] - 'a'];
			if (nxt == -1) {
				nxt = add_node();
				nodes[cur].childs[s[i] - 'a'] = nxt;
				nodes[nxt].par = cur;
				nodes[nxt].c = s[i] - 'a';
				nodes[cur].count++;
			}
			cur = nxt;
		}
		nodes[cur].last = true;
		return cur;
	}

	void build_shortcut() {
		for (int i = sz(nodes) - 1; i > 0; i--) {
			int par = nodes[i].par;
			while (nodes[par].count == 1 && !nodes[par].last && nodes[par].c != 'D') {
				const int ppar = nodes[par].par;
				if (ppar == -1) break;
				if (nodes[ppar].childs[nodes[par].c] != par) {
					cout << "?";
				}
				nodes[ppar].childs[nodes[par].c] = i;
				nodes[i].par = ppar;
				nodes[par].c = 'D';
				par = ppar;
			}
		}
	}

	void build_last_count() {
		for (int i = sz(nodes) - 1; i > 0; i--) {
			if (nodes[i].last) nodes[i].last_count++;
			FOR(j, 26) {
				const int ch = nodes[i].childs[j];
				if (ch == -1) continue;
				nodes[i].last_count += nodes[ch].last_count;
			}
		}
	}

	void dbg_dfs(int cur, int dep) {
		FOR(i, 26) {
			if (nodes[cur].childs[i] == -1) continue;
			int ch = nodes[cur].childs[i];
			if (nodes[ch].par != cur) {
				cout << "?";
			}
			FOR(i, dep) putchar('-');
			putchar(i + 'a');
			printf(" %d", ch);
			if (nodes[ch].last) printf("*");
			puts("");

			dbg_dfs(ch, dep + 1);
		}
	}

	void dbg() {
		dbg_dfs(0, 0);
	}

	bool check(const char* s) {
		int cur = 0;
		for (int i = 0; s[i]; i++) {
			int nxt = nodes[cur].childs[s[i] - 'a'];
			if (nxt == -1) return false;
			cur = nxt;
		}
		return nodes[cur].last;
	}
};


int main() {
	int n; reader(n);
	vector<string> s(n);
	FOR(i, n) reader(s[i]);

	vector<int> tt_last;
	trie_tree tt;
	FOR(i, n) {
		tt_last.push_back(tt.add(s[i].c_str()));
	}
//	tt.dbg();
	tt.build_shortcut();
	tt.build_last_count();
// 	tt.dbg();

	int q; reader(q);
	FOR(_, q) {
		int k; char p[27]; reader(k, p);
		FOR(i, 26) p[i] -= 'a';

		int ans = 0;
		int tt_cur = tt_last[k - 1];
		int ttl = tt_cur;
		tt_cur = tt.nodes[tt_cur].par;
		while (tt_cur != -1) {
			if (tt.nodes[tt_cur].last) ans++;
			FOR(i, 26) {
				int ch = tt.nodes[tt_cur].childs[p[i]];
				if (ch == -1) continue;
				if (ch == ttl) break;
				ans += tt.nodes[ch].last_count;
			}
			ttl = tt_cur;
			tt_cur = tt.nodes[tt_cur].par;
		}
		writerLn(ans + 1);
	}
}

Measured memory_bytes: 62824