#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
typedef pair<pii,pii> e;
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
vector<string> v;
int com[100000][26][26];
int fre[100000];
void dfs(int l,int r,int k){
    //cout<<l<<" "<<r<<" "<<k<<endl;
    int sta=l;
    if(v[l].size()==k){
        sta++;
        fre[l]+=r-l-1;
    }
    int now=0;
    pii p[26];
    int u=sta,d=sta;
    for(;;){
        while(u<r&&v[u][k]==(char)('a'+now)){
            u++;
        }
        p[now]={d,u};
        d=u;
        now++;
        if(now==26)break;
    }
   // if(l==1)cout<<p[0].first<<" "<<p[0].second<<" "<<p[1].first<<" "<<p[1].second<<endl;
    rep(i,sta,r){
        rep(j,0,26){
            if((int)(v[i][k]-'a')==j)continue;
            com[i][v[i][k]-'a'][j]+=p[j].second-p[j].first;
        }
    }
    rep(i,0,26){
        if(p[i].second==p[i].first)continue;
        dfs(p[i].first,p[i].second,k+1);
    }
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n;
    string s[n];
    vector<pair<string,int>> ww;
    rep(i,0,n){
        cin>>s[i];
        v.push_back(s[i]);
        ww.push_back({s[i],i});
    }
    sort(v.begin(),v.end());
    fill(fre,fre+n,0);
    sort(ww.begin(),ww.end());
    int tai[n];
    rep(i,0,n){
        tai[ww[i].second]=i;
    }
    memset(com,0,sizeof com);
    dfs(0,n,0);
    
   
    int q;cin>>q;
    rep(i,0,q){
        int k;string r;cin>>k>>r;
        k--;
        k=tai[k];
        int pla[26];
        rep(j,0,26){
            pla[r[j]-'a']=j;
        }
        int ans=n;
        rep(j,0,26){
            rep(kk,0,26){
                if(pla[kk]>pla[j]){
                    ans-=com[k][j][kk];
                }
            }
        }
        ans-=fre[k];
        cout<<ans<<endl;
    }
}



Measured memory_bytes: 384156