#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

int n;
vector<vi> s;


int hyou[100000][27][27];
int offset[100000];

void solve(bool is_reverse) {
  using arr = array<int, 27>;
  map<int, arr> mp;
  using P = pair<int, pii>;
  stack<P> st;

  rep (i, n) {
    //DEBUG(i);
    if (i != 0) {
      int idx;
      rep (j, 100000000) {
        if (s[i - 1][j] != s[i][j]) {
          idx = j;
          break;
        }
      }

      int l = i - 1;
      while (st.size() > 0) {
        if (st.top().first > idx) {
          P ilr = st.top();
          st.pop();
          mp.erase(ilr.first);
          l = ilr.second.first;
        }
        else {
          if (st.top().first < idx) {
            arr temp;
            fill(all(temp), 0);
            mp[idx] = temp;
          }
          break;
        }
      }

      st.push(make_pair(idx, pii(l, i)));
      for (int j = l; j < i; j++) {
        mp[idx][s[j][idx]]++;
      }
    }
    
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
      int idx = itr->first;
      arr a = itr->second;
      //DEBUG(idx);
      //DEBUG_VEC(a);
      int real_i = i;
      if (is_reverse) real_i = n - 1 - i;
      rep (j, 27) {
        hyou[real_i][j][s[i][idx]] += a[j];
      }
    }
  }
}

signed main() {
  fio();
  cin >> n;
  s.resize(n);

  vi perm(n);
  vector<pair<vi, int>> si(n);
  rep (i, n) {
    string temp;
    cin >> temp;
    int m = temp.size();
    si[i].first.resize(m);
    rep (j, m) {
      si[i].first[j] = temp[j] - 'a' + 1;
    }
    si[i].second = i;
  }
  sort(all(si));

  rep (i, n) {
    s[i] = si[i].first;
    s[i].push_back(0);
    perm[si[i].second] = i;
  }

  //DEBUG_MAT(s);

  solve(false);
  reverse(all(s));
  solve(true);

  int q;
  cin >> q;
  while (q--) {
    int k;
    cin >> k;
    k--;
    string s;
    cin >> s;
    vi pos(27);
    rep (i, 26) {
      pos[s[i] - 'a' + 1] = i + 1;
    }

    int ans = 0;
    int i = perm[k];
    rep (j, 27) {
      rep (k, 27) {
        if (j == k) continue;
        if (pos[j] < pos[k]) ans += hyou[i][j][k];
      }
    }
    cout << ans + 1 << endl;
  }
}


Measured memory_bytes: 299264