#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr ll MOD = 1e9 + 7;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
struct Trie {
    Trie *nxt[26];
    int cnt[26];
    Trie() {
        fill(nxt, nxt + 26, nullptr);
        fill(cnt, cnt + 26, 0);
    }
};
void insert(string &s, Trie *r) {
    for (int i = 0; i < s.size(); i++) {
        int c = (s[i] - 'a');
        if (!r->nxt[c]) {
            r->nxt[c] = new Trie;
        }
        r->cnt[c]++;
        r = r->nxt[c];
    }
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<string> s(n);
    Trie *t = new Trie;
    for (int i = 0; i < n; i++) {
        cin >> s[i];
        insert(s[i], t);
    }
    vector<int> pre(n);
    vector<vector<vector<int>>> f(n, vector<vector<int>>(26, vector<int>(26)));
    for (int i = 0; i < n; i++) {
        Trie *nt = t;
        for (int j = 0; j < s[i].size(); j++) {
            int c = s[i][j] - 'a';
            for (int k = 0; k < 26; k++) {
                if (k != c) {
                    f[i][c][k] += nt->cnt[k];
                }
            }
            nt = nt->nxt[c];
        }
        for (int k = 0; k < 26; k++) {
            pre[i] += nt->cnt[k];
        }
    }
    int q;
    cin >> q;
    while (q--) {
        int k;
        cin >> k;
        --k;
        string p;
        cin >> p;
        int res = n - pre[k];
        for (int i = 0; i < 26; i++) {
            for (int j = i + 1; j < 26; j++) {
                res -= f[k][p[i] - 'a'][p[j] - 'a'];
            }
        }
        cout << res << endl;
    }
}