Problem:
Search III

Your task is to write a program of a simple dictionary which implements the following instructions:

insert str: insert a string str in to the dictionary

find str: if the distionary contains str, then print 'yes', otherwise print 'no'

Input

In the first line n, the number of instructions is given. In the following n lines, n instructions are given in the above mentioned format.

Output

Print yes or no for each find instruction in a line.

Constraints

A string consists of 'A', 'C', 'G', or 'T'

1 ≤ length of a string ≤ 12

n ≤ 1000000

Sample Input 1

5
insert A
insert T
insert C
find G
find A

Sample Output 1

no
yes

Sample Input 2

13
insert AAA
insert AAC
insert AGA
insert AGG
insert TTT
find AAA
find CCC
find CCC
insert CCC
find CCC
insert T
find TTT
find T

Sample Output 2

yes
no
no
yes
yes
yes

Notes

Template in C

Solution in C (judge verdict: Time Limit Exceeded)

#include<stdio.h>
#include<string.h>
#define N_MAX 1000005
#define str_MAX 12

char data [N_MAX][str_MAX];
int sum=0;

void insert(char s[str_MAX])
{	
	strcpy(data[sum], s);
	sum++;
}

void find(char s[str_MAX])
{
	int i;
	int flag=0;
	for(i=0; i<sum; i++){
			if(strcmp(data[i], s) == 0){
					flag=1;
					break;
			}
	}

	if(flag == 1){
		printf("yes\n");
	}
	else{
		printf("no\n");
	}
}

int main()
{
	int n;
	int i;
	char cm [100], s[str_MAX];

	scanf("%d", &n);

	for(i=0; i<n; i++){
		scanf("%s%s", cm, s);

		if(strcmp(cm, "insert") == 0) insert(s);
		if(strcmp(cm, "find") == 0) find(s);
	}
	return 0;
}