#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long double ld;

#define mk make_pair
#define inb push_back
#define enb emplace_back
#define X first
#define Y second
#define all(v) v.begin(), v.end()
#define sqr(x) (x) * (x)
#define TIME 1.0 * clock() / CLOCKS_PER_SEC
#define y1 AYDARBOG
//continue break pop_back return

int solve();

int main()
{
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);
#define TASK "search5"
#ifndef _DEBUG
    freopen(TASK".in", "r", stdin), freopen(TASK".out", "w", stdout);
#endif
    solve();
#ifdef _DEBUG
    fprintf(stderr, "\nTIME: %.3f\n", TIME);
#endif
}

const int BUFSZ = (int)1e6 + 7;
char buf[BUFSZ];
string get_str()
{
    scanf(" %s", buf);
    return string(buf);
}

struct Trie
{
    struct Node
    {
        int cnt;
        int suf;
        vi go;
        Node() { cnt = 0, suf = 0, go.assign(26, -1); };
    };
    vector<Node> t;
    vector<vi> g;
    vll dp;
    Trie() { t.inb(Node()); };
    int adds(string s)
    {
        int u = 0;
        for (int i = 0; i < (int)s.size(); ++i)
        {
            if (t[u].go[s[i] - 'a'] == -1)
            {
                t[u].go[s[i] - 'a'] = t.size();
                t.inb(Node());
            }
            u = t[u].go[s[i] - 'a'];
        }
        return u;
    }
    void buildAK()
    {
        g.resize(t.size());
        dp.assign(t.size(), -1);
        queue<int> q;
        q.push(0);
        while (!q.empty())
        {
            int u = q.front();
            q.pop();
            g[t[u].suf].inb(u);
            for (int i = 0; i < 26; ++i)
            {
                int to = 0;
                if (u)
                    to = t[t[u].suf].go[i];
                if (t[u].go[i] != -1)
                {
                    t[t[u].go[i]].suf = to;
                    q.push(t[u].go[i]);
                }
                else
                {
                    t[u].go[i] = to;
                }
            }
        }
    }
    void run(string s)
    {
        int u = 0;
        for (int i = 0; i < (int)s.size(); ++i)
        {
            u = t[u].go[s[i] - 'a'];
            ++t[u].cnt;
        }
    }
    ll calc(int u)
    {
        if (dp[u] != -1)
            return dp[u];
        dp[u] = t[u].cnt;
        for (int to : g[u])
            dp[u] += calc(to);
        return dp[u];
    }
};

int solve()
{
    int n;
    scanf("%d", &n);
    Trie T;
    vi tpos(n);
    for (int i = 0; i < n; ++i)
    {
        tpos[i] = T.adds(get_str());
    }
    T.buildAK();
    T.run(get_str());
    for (int i = 0; i < n; ++i)
    {
    if (TASK == "search5")
        printf("%lld\n", T.calc(tpos[i]));
    else
        puts((T.calc(tpos[i])) ? "YES" : "NO");
    }
    return 0;
}