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

int main(){
	int n,num;
	map<int,int> M;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&num);
		M[num]++;
	}
	int q;
	scanf("%d",&q);
	int query;
	for(int i=0;i<q;i++){
		int queries=0;
		scanf("%d",&query);
		if(M[query]!=0){
			printf("find\n");
			queries=1;
		}
		if(queries==0) printf("no\n");
		M[query]++; 
	}
	return 0;
}