// {{{ by shik
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }

template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
    int c=0;
    while ( *s!=',' || c!=0 ) {
        if ( *s=='(' || *s=='[' || *s=='{' ) c++;
        if ( *s==')' || *s==']' || *s=='}' ) c--;
        cerr<<*s++;
    }
    cerr<<"="<<head<<", ";
    _dump(s+1,tail...);
}

#define dump(...) do { \
    fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
    _dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)

template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
    s<<"[";
    for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
    s<<"]";
    return s;
}

template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif

template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }

void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
    _R(head);
    R(tail...);
}

template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
    for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
        if ( i!=x.cbegin() ) putchar(' ');
        _W(*i);
    }
}

void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
    _W(head);
    putchar(sizeof...(tail)?' ':'\n');
    W(tail...);
}

#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
    freopen(name ".in","r",stdin); \
    freopen(name ".out","w",stdout); \
} while (0)
#endif

// }}}

const int N=1e5+10;
const int M=4e5+10;

int idx[M],leaf[M],cnt[M],nch[M],ch[M][26],cn=0,pos[N];
void ins( int id, const char *s ) {
    int p=0;
    for ( int i=0; s[i]; i++ ) {
        cnt[p]++;
        idx[p]=id;
        int c=s[i]-'a';
        int &np=ch[p][c];
        if ( np==0 ) {
            nch[p]++;
            np=++cn;
        }
        p=np;
    }
    cnt[p]++;
    idx[p]=id;
    leaf[p]=id;
    pos[id]=p;
}

int skip[M],dst[M];
void compress( int p ) {
    if ( !leaf[p] && nch[p]==1 ) {
        int c=0;
        while ( c<26 && !ch[p][c] ) c++;
        assert(c!=26);
        int np=ch[p][c];
        compress(np);
        if ( skip[np] ) {
            skip[p]=skip[np]+1;
            dst[p]=dst[np];
        } else {
            dst[p]=np;
            skip[p]=1;
        }
    } else {
        REP(i,26) if ( ch[p][i] ) compress(ch[p][i]);
    }
}

int solve( int o[26], const char *s ) {
    int io[26]={};
    REP(i,26) io[o[i]]=i;
    int p=0,ans=0;
    for ( int i=0; s[i]; i++ ) {
        dump(i,p,ans,skip[p],dst[p]);
        if ( skip[p] ) {
            i+=skip[p]-1;
            p=dst[p];
            continue;
        }
        if ( leaf[p] ) ans++;
        int c=s[i]-'a';
        REP(j,io[c]) {
            int t=ch[p][o[j]];
            if ( t ) ans+=cnt[t];
        }
        // assert(ch[p][c]);
        p=ch[p][c];
    }
    ans++;
    return ans;
}

string s[N];
int main() {
    int n;
    R(n);
    REP1(i,1,n) {
        R(s[i]);
        ins(i,s[i].data());
    }
    compress(0);
    int q;
    R(q);
    while ( q-- ) {
        int k;
        char buf[30];
        R(k,buf);
        int o[26];
        REP(i,26) o[i]=buf[i]-'a';
        int ans=solve(o,s[k].data());
        W(ans);
    }
    return 0;
}


Measured memory_bytes: 62724