#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>
#include <unordered_map>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "[";
    for (auto it = mp.begin(); it != mp.end(); ++it) {
        if (it != mp.begin()) {
            os << ", ";
        }
        os << *it;
    }
    return os << "]";
}

// edit
//struct Solve {
//    vector<vector<int>> tree; //try-tree;
//    vector<map<int, int>> tree;
//    vector<unordered_map<char, int>> tree;
//vector<map<char, int>> tree;
//vector<unordered_map<char, int>> tree;
vector<map<short, int>> tree;
vector<int> cnt; // node cnt
vector<int> sz; // try-tree's sub-tree size
vector<int> nidx;
vector<string> S;

// sz(部分木のアレの数)を求める
int dfs(int v = 0) {
    int &ret = sz[v];
    ret += cnt[v];
//        for (int i = 0; i < 26; ++i) {
//            if (tree[v][i] != -1) {
//                int tmp = dfs(tree[v][i]);
//                ret += tmp;
//            }
//        }

    for (auto e : tree[v]) {
        int tmp = dfs(e.second);
        ret += tmp;
    }

    return ret;
}

// 木を短くする
void short_cut() {
    for (int i = SZ(tree) - 1; i >= 0; --i) {
        for (auto v : tree[i]) {
            if (v.second < tree.size() && tree[v.second].size() == 1 && cnt[v.second] == 0) {
                int to = tree[v.second].begin()->second;
                tree[i][v.first] = to;

            }

        }
    }
}


// クエリに答える
inline int query(int k, string p) {
    string s = S[k - 1];
    int ret = 1;

    int v = 0;
    int idx = 0;
    while (idx < s.size()) {
        for (int i = 0; p[i] != s[idx]; ++i) {
            if (tree[v].count(p[i] - 'a')) {
                ret += sz[tree[v][p[i] - 'a']];
            }
        }

        if (!tree[v].count(s[idx] - 'a')) {
            break;
        }

        ret += cnt[v];
        v = tree[v][s[idx] - 'a'];
        idx = nidx[v];

    }

    return ret;
}

// いらない後ろの文字を削除
void cut() {
    int ng = 0, ok = 400000;

    while (ok - ng > 1) {
        int mid = (ok + ng) / 2;
        set<string> st;
        for (int i = 0; i < S.size(); ++i) {
            st.insert(S[i].substr(0, mid));
        }
        if (st.size() == S.size()) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    for (int i = 0; i < S.size(); ++i) {
        S[i] = S[i].substr(0, ok);
    }

}


void solve() {
//        tree.resize(1, vector<int>(26, -1));
    tree.resize(1);
    cnt.resize(1);
    sz.resize(1);
    nidx.resize(1, 0);

    int N;
//    cin >> N;
    scanf("%d", &N);
    S.resize(N);


    char buf[432100];
    REP(i, N) {
//        string s;
//        cin >> s;
//        S.push_back(s);
//        cin >> S[i];
        scanf("%s", buf);
//        S.emplace_back(buf);
        S[i] = buf;
    }

//        cut();


    REP(i, N) {
        string &s = S[i];

        int v = 0; // try-node

        int idx = 0;
        for (auto c : s) {
//                if (tree[v][c - 'a'] == -1) {
            if (!tree[v].count(c - 'a')) {
//                    tree[v][c - 'a'] = tree.size();
//                    tree.emplace_back(26, -1);
                tree[v][c - 'a'] = tree.size();
                tree.emplace_back();
                cnt.push_back(0);
                sz.push_back(0);
                nidx.push_back(0);
            }

            nidx[v] = idx;
            v = tree[v][c - 'a'];
            idx++;
        }

        cnt[v] = 1;
    }

//        cout << tree << endl;

    dfs();
    short_cut();

    set<char> app;
    for (int i = 0; i < N; ++i) {
        for (auto c : S[i]) {
            app.insert(c);
        }
    }

    int Q;
//    cin >> Q;
    scanf("%d", &Q);
    while (Q--) {
        int k;
        string p;
        scanf("%d", &k);
        scanf("%s", buf);
//        cin >> k >> p;
        p = buf;
        string q;

        for (auto c : p) {
            if (app.count(c)) {
                q += c;
            }
        }


//            int ans = query(k, p);
        int ans = query(k, q);
        cout << ans << endl;
    }

}

//};


int main() {
//    cin.tie(0);
//    ios::sync_with_stdio(false);
//    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    solve();
//    Solve().solve();


    return 0;
}


Measured memory_bytes: 54696