#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int son[N][26], cnt[N], idx;
char str[N];
void insert(string str)
{
int p = 0;
for (int i = 0; str[i]; i ++ )
{
int u = str[i] - 'a';
if (!son[p][u]) son[p][u] = ++ idx;
p = son[p][u];
}
cnt[p] ++ ;
}
int query(string str)
{
int p = 0;
for (int i = 0; str[i]; i ++ )
{
int u = str[i] - 'a';
if (!son[p][u]) return 0;
p = son[p][u];
}
cnt[p]++;
if(cnt[p]>2){
return 2;
}else if(cnt[p]==2){
return 1;
}
return 0;
}
int main()
{
int n;
scanf("%d", &n);
while (n -- )
{
string s;cin>>s;
insert(s);
}
cin>>n;
while(n--){
string s;cin>>s;
int t=query(s);
if(t==2){
cout<<"REPEAT"<<endl;
}else if(t==1){
cout<<"OK"<<endl;
}else{
cout<<"WRONG"<<endl;
}
}
return 0;
}