TRIE

//In the Name of Allah Most Gracious, Most Merciful//
/*If you want something you've never had, you have  to do something you never did.*/

#include<bits/stdc++.h>
using namespace std;


#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define M 100007
#define INF 1e9
#define INFL 1e18
#define PI acos(-1)
#define mp make_pair
#define fast_in_out ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//const int fx[]= {+1,-1,+0,+0};
//const int fy[]= {+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move

struct node
{
    bool endmark;
    node* next[27];
    node()
    {
        endmark=false;
        for(int i=0;i<26;i++)
        {
            next[i]=NULL;
        }
    }
}*root;


void insertnode(string str,int len)
{
    node* curr=root;
    for(int i=0;i<len;i++)
    {
        int id=str[i]-'a';

        if(curr->next[id]==NULL)
        {
            curr->next[id]=new node();
        }
        curr=curr->next[id];
    }

    curr->endmark=true;
}
bool searchstring(string str,int len)
{
    node *curr=root;

    for(int i=0;i<len;i++)
    {
        int id=str[i]-'a';

        if(curr->next[id]==NULL)
        {
            return false;
        }
        curr=curr->next[id];
    }
    return curr->endmark;
}


void del(node* cur)
{
    for(int i=0;i<26;i++)
    {
        if(cur->next[i])
        {
            del(cur->next[i]);
        }
    }
    delete (cur);
}



int main()
{
    fast_in_out;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int n;
    cin>>n;
   // getchar();
    root=new node();
    for(int i=0;i<n;i++)
    {
        string a;
        cin>>a;
        insertnode(a,a.size());
    }
    cout<<"QUERY"<<endl;
    int q;
    cin>>q;

    for(int i=0;i<q;i++)
    {
        string a;
        cin>>a;
       //cout<<str<<endl;
        if(searchstring(a,a.size()))
        {
            cout<<"FOUND"<<endl;
        }
        else
        {
            cout<<"NOT  FOUND"<<endl;
        }
    }
    del(root);
    return 0;
}