#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define io ios_base::sync_with_stdio(), cin.tie(0), cout.tie(0)

using namespace std;

const int maxn = 100007;

struct trie
{
    trie *nxt[26];
    int n_end = 0, pre_end = 0;
    int str_cnt = 0;//number of string that this node is a prefix
};

string st[maxn];
int n, q, cur[26][26] = {}, prefix[maxn];
int c[maxn][26][26];//number of strings that first different char with st[i] is (x,y)
trie* root;

void add_node(trie* &node)
{
    node = new trie;
    for (int i = 0; i < 26; ++i)
        node->nxt[i] = nullptr;
    node->n_end = node->str_cnt = node->pre_end = 0;
}

void add_str(int id)
{
    trie* p = root;
    for (char c: st[id])
    {
        int nc = c - 'a';
        if (p->nxt[nc] == nullptr) add_node(p->nxt[nc]);
        ++(p->nxt[nc]->str_cnt);
        p = p->nxt[nc];
    }
    p->n_end = id, p->pre_end = 1;
}

void pre_calc(trie *p)
{
    if (p->n_end)
    {
        for (int i = 0; i < 26; ++i)
            for (int j = 0; j < 26; ++j)
                c[p->n_end][i][j] = cur[i][j];
        prefix[p->n_end] = p->pre_end;
    }

    for (int i = 0; i < 26; ++i)
        if (p->nxt[i] != nullptr)
        {
            for (int j = 0; j < 26; ++j)
                if (i != j && p->nxt[j] != nullptr) cur[i][j] += p->nxt[j]->str_cnt;
            p->nxt[i]->pre_end += p->pre_end;
            pre_calc(p->nxt[i]);
            for (int j = 0; j < 26; ++j)
                if (i != j && p->nxt[j] != nullptr) cur[i][j] -= p->nxt[j]->str_cnt;
        }
}

int main()
{
//    freopen("test.INP","r",stdin);
    io;
    cin >> n, add_node(root);
    for (int i = 1; i <= n; ++i) cin >> st[i], add_str(i);

    pre_calc(root);
//
    cin >> q;
    while (q--)
    {
        int id;
        string alp;
        cin >> id >> alp;
        int res = prefix[id];

        for (int i = 0; i < 26; ++i)
            for (int j = i + 1; j < 26; ++j)
                res += c[id][alp[j] - 'a'][alp[i] - 'a'];

        cout << res << endl;
    }
}
