#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{
    long long start_, end_, step_;
   public:
    struct range_iterator{
      long long val, step_;
      range_iterator(long long v, long long step) : val(v), step_(step) {}
      long long operator * (){return val;}
      void operator ++ (){val += step_;}
      bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}
    };
    range(long long len) : start_(0), end_(len), step_(1) {}
    range(long long start, long long end) : start_(start), end_(end), step_(1) {}
    range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}
    range_iterator begin(){ return range_iterator(start_, step_); }
    range_iterator   end(){ return range_iterator(  end_, step_); }
  };

  string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){
    stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
  }

  string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }

}

constexpr long long mod = 9_ten + 7;

int main(){
  int n;
  cin >> n;
  vector<string> s(n);
  cin >> s;

  vector<int> cnt(1, 0);
  vector<char> c;
  vector<int> to;
  vector<int> depth(1, 0);
  vector<vector<int>> trie(1);
  for(auto& ss : s){
    ss += '{';
    int pos = 0;
    for(int i : range(ss.size())){
      cnt[pos]++;

      int nx = -1;
      for(int j : trie[pos]){
        if( c[j] == ss[i] ){
          nx = to[j];
          break;
        }
      }
      if(nx == -1){
        trie.push_back({});
        cnt.push_back(0);
        depth.push_back( depth[pos] + 1 );
        trie[pos].push_back( to.size() );

        c.push_back( ss[i] );

        to.push_back( trie.size()-1 );
        nx = to.back();
      }

      pos = nx;
    }
    cnt[pos]++;
  }

  function<void(int)> compress = [&](int pos){
    int pos_ = pos;
    while( trie[pos_].size() == 1 ){
      pos_ = to[trie[pos_][0]];
      to[trie[pos][0]] = pos_;
    }
    for(int edge : trie[pos]){
      compress( to[edge] );
    }
  };

  compress(0);

  auto get = [&](int k, vector<int>& c_rank){
    int pos = 0;
    int rank = 0;
    int dd = 0;
    while(dd < s[k].size()){
      // eprintln(s[k].substr(0, dd+1));
      // eprintln(rank);
      int nx = -1;
      for(int edge : trie[pos]){
        if(c_rank[ s[k][dd] - 'a' ] > c_rank[ c[edge]-'a' ] ){
          rank += cnt[ to[edge] ];
        }
        if( c[edge] == s[k][dd] ){
          nx = to[edge];
        }
      }
      pos = nx;
      dd = depth[pos];
    }
    return rank;
  };


  int q;
  cin >> q;
  while(q--){
    int k; string p;
    cin >> k,p;
    vector<int> c_rank(27, -1);
    for(int i : range(26)){
      c_rank[ p[i] - 'a' ] = i;
    }

    int ans = get(k-1, c_rank);
    println(ans+1);
  }


  return 0;
}


Measured memory_bytes: 28200