#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

int pos[1111];
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int n, q;
  cin>>n;
  vector<pair<string, int>> strs;
  RE (i, n) {
    string s;
    cin>>s;
//     for (char& c : s) {
//       c -= 'a' - 1;
//     }
    s.PB(0);
    strs.PB({s, i});
  }
  cin>>q;
  sort(ALL(strs));
  VI wh(n + 1);
  REP (i, n) {
    wh[strs[i].nd] = i;
  }
  debug(strs);
  vector<vector<TIII>> grps;
  VVI wh_grp(n);
  
  REP (i, n) {
    string prv = "";
    if (i) {
      prv = strs[i - 1].st;
    }
    string& cur = strs[i].st;
    wh_grp[i].resize(SZ(cur) + 1);
    bool so_far_eq = true;
    REP (j, SZ(cur)) {
      if (so_far_eq && i) {
        wh_grp[i][j] = wh_grp[i - 1][j];
      } else  {
        wh_grp[i][j] = SZ(grps);
        grps.PB({});
      }
        
      if (so_far_eq && SZ(prv) >= j + 1 && cur[j] == prv[j]) {
        grps[wh_grp[i][j]].back().nd++;
      } else {
        grps[wh_grp[i][j]].PB({cur[j], 1, j});
        so_far_eq = false;
      }
    }
    debug(i, wh_grp[i]);
  }
  REP (i, SZ(grps)) {
    debug(i, grps[i]);
  }
  //debug(grps);
  VVI int_grps(n);
  REP (i, n) {
    REP (j, SZ(strs[i].st) - 1) {
      if (SZ(grps[wh_grp[i][j]]) > 1) {
        int_grps[i].PB(wh_grp[i][j]);
      }
    }
    debug(int_grps[i]);
  }
  RE (i, q) {
    int x;
    cin>>x;
    x = wh[x];
    string per;
    cin>>per;
    int omitted = 0;
    REP (j, 26) {
      pos[(int)per[j]] = j + 1;
    }
    for (auto int_grp : int_grps[x]) {
      for (auto p : grps[int_grp]) {
        if (pos[p.st] < pos[(int)strs[x].st[p.rd]]) {
          omitted += p.nd;
        }
      }
    }
    
    cout<<omitted + 1<<"\n";
  }
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 33516