#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

int main() {
	ll N;
	cin >> N;

	vector<string> s(N + 1);
	repn(i, N) {
		cin >> s[i];
		s[i] += '*';
	}

	vvll g;
	vll ch;
	g.push_back({});
	ch.push_back('.');

	vvll path(N + 1);

	repn(i, N) {
		ll v = 0;
		path[i].push_back(0);

		rep(j, s[i].size()) {
			ll newv = -1;

			ll c = 0;
			if (s[i][j] != '*') { c = s[i][j] - 'a' + 1; }

			for (ll w : g[v]) {
				if (ch[w] == c) { newv = w; break; }
			}
			if (newv == -1) {
				newv = g.size();
				g.push_back({});
				g[v].push_back(newv);
				ch.push_back(c);
			}

			v = newv;
			path[i].push_back(v);
		}
		
	}

	//repn(i, N) cout << leaf[i] << endl;

	ll M = g.size();

	//rep(v, M) {
	//	cout << v << " " << ch[v] << endl;
	//	for (ll w : g[v]) { cout << v << w << endl; }
	//
	//	cout << endl;
	//}

	vll sz(M, 0);
	for (ll v = M - 1; v >= 0; v--) {
		if (g[v].size() == 0) { sz[v] = 1; }
		for (ll w : g[v]) { sz[v] += sz[w]; }
	}

	//rep(v, M)cout << v << " " << sz[v] << endl;

	vector<vector<vector<int>>> lex(N+1, vector<vector<int>>(27, vector<int>(27, 0)));

	repn(i, N) {
		ll t = path[i].size();

		rep(j, t - 1) {
			ll v = path[i][j];
			for (ll w : g[v]) {
				if (w == path[i][j + 1]) { continue; }
				lex[i][ch[path[i][j + 1]]][ch[w]] += sz[w];
			}
		}
	}
	

	//rep(v, M) {
	//	rep(i, 27)rep(j, 27) {
	//		if (lex[v][i][j] != 0) { cout << v << i << j << " " << lex[v][i][j] << endl; }
	//	}
	//}

	ll Q;
	cin >> Q;
	repn(q, Q) {
		ll k;
		string p;
		cin >> k >> p;

		vll banme(27, 0);
		rep(i, 26) {
			banme[p[i] - 'a' + 1] = i + 1;
		}

		ll ans = 1;
		rep(i, 27)rep(j, 27) {
			if (banme[i] < banme[j]) { ans += lex[k][j][i]; }
		}
		cout << ans << endl;
	}


}



Measured memory_bytes: 433788