RE了

#include<bits/stdc++.h>
#define maxn 10001
using namespace std;
int n,m,tot=1;
string s;
struct node{
	int son[1000];
	int val;
}tree[maxn];
void insert(string s){
	int len=s.length();
	int p=1;
	for(int i=0;i<len;++i){
		int ch=s[i]-'a';
		if(tree[p].son[ch]==0){
			tree[p].son[ch]=++tot;
		}
		p=tree[p].son[ch];
	}
	tree[p].val++;
}
int find(string s){
	int len=s.length(),p=1;
	for(int i=0;i<len;++i){
		int ch=s[i]-'a';
		if(tree[p].son==0) return 0;
	    p=tree[p].son[ch];
	}
	if(tree[p].val) {
		return tree[p].val++;
	}
	else return 0;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;++i){
		cin>>s;
		insert(s);
	}
	cin>>m;
	for(int i=1;i<=m;++i){
		cin>>s;
		if(find(s)==1) cout<< "OK"<<endl;
		else if(find(s)==0) cout<<"WRONG"<<endl;
		else if(find(s)>1)  cout<<"REPEAT"<<endl;
	}
	return 0;
}