#include <bits/stdc++.h>
using namespace std;

struct node {
  vector<int> cnt, to;
  node() : cnt(26, 0), to(26, -1) {}
};

struct quer {
  int id;
  string c;
};

int n, q;
vector<string> s;
vector<vector<quer>> queries;
vector<int> res;
vector<node> trie;

void solve();
void add(string &t);

int main() {
  cin >> n;
  s.resize(n);
  for (auto &p : s) cin >> p;
  cin >> q;
  res.assign(q, n);
  queries.resize(n);
  for (int i = 0; i < q; ++i) {
    int k;
    string t;
    cin >> k >> t;
    queries[--k].push_back({i, t});
  }
  solve();
  for (auto p : res) cout << p << endl;
  return 0;
}

void solve() {
  trie.push_back(node());
  for (auto &t : s) add(t);
  for (int i = 0; i < n; ++i) {
    auto t = s[i];
    int len = t.size(), now = 0;
    vector<vector<int>> memo(26, vector<int>(26, 0));
    for (int j = 0; j < len; ++j) {
      int c = t[j] - 'a';
      for (int k = 0; k < 26; ++k) memo[c][k] += trie[now].cnt[k];
      if (j == len - 1)
        for (auto p : queries[i]) res[p.id] -= trie[now].cnt[c] - 1;
      now = trie[now].to[c];
    }
    for (auto p : queries[i])
      for (int j = 0; j < 26; ++j)
        for (int k = j + 1; k < 26; ++k)
          res[p.id] -= memo[p.c[j] - 'a'][p.c[k] - 'a'];
  }
}

void add(string &t) {
  int len = t.size(), now = 0;
  for (int i = 0; i < len; ++i) {
    int to = t[i] - 'a';
    auto nod = &trie[now];
    if (nod->to[to] < 0) {
      nod->to[to] = trie.size();
      trie.push_back(node());
    }
    ++trie[now].cnt[to];
    now = trie[now].to[to];
  }
}