#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};

int mod = 1000000007;
//int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

class Trie{
#define N_alphabet 26
#define begin_alphabet 'a'
public:
    Trie *next[N_alphabet];
    bool exist = false;
    int cnt = 0;
 
    Trie(){
        fill(next, next + N_alphabet, (Trie *)0);
    }
 
    void insert(string &S, int i = 0){
        this->cnt++;
        if(i == S.size()){
            this->exist = true;
            return;
        }
        if(this->next[S[i] - begin_alphabet] == NULL)
            this->next[S[i] - begin_alphabet] = new Trie();
        this->next[S[i] - begin_alphabet]->insert(S, i + 1);
    }

    void dfs(string &S, mat &comp, int &n, int i = 0){
        if(i == S.size()) return;
        if(this->exist) n++;
        int now = S[i] - begin_alphabet;
        REP(j, N_alphabet) if(this->next[j] != NULL) comp[now][j] += this->next[j]->cnt;
        this->next[now]->dfs(S, comp, n, i + 1);
    }

};

signed main(){

    int N; cin >> N;
    vector<string> S(N);
    readv(S);
    Trie T;
    REP(i, N) T.insert(S[i]);

    int Q; cin >> Q;
    vec ans(Q);
    mat qs(N);
    vec k(Q);
    vector<string> p(Q);
    REP(i, Q){
        cin >> k[i] >> p[i];
        k[i]--;
        qs[k[i]].pb(i);
    }

    REP(i, N){
        if(SZ(qs[i]) == 0) continue;
        mat comp(26, vec(26, 0));
        int n = 0;
        T.dfs(S[i], comp, n);
        for(int q: qs[i]){
            ans[q] = n + 1;
            REP(j1, 26) REP(j2, j1) ans[q] += comp[p[q][j1] - 'a'][p[q][j2] - 'a'];
        }
    }
    REP(i, Q) cout << ans[i] << endl;

    return 0;
}


Measured memory_bytes: 104704