#include <iostream>
#include <cstring>
using namespace std;
const int N = 100003;
int h[N],e[N],ne[N],idx;
void insert(int x) //插入
{
int k = (x % N + N) % N;
e[idx] = x;
ne[idx] = h[k];
h[k] = idx ++;
}
bool find(int x)//查询
{
int k = (x % N + N) % N;
for(int i = h[k];i != -1;i = ne[i])
if(e[i] == x)
return true;
return false;
}
int main()
{
int n;
cin >> n;
memset(h , -1,sizeof h);
while(n --)
{
char op[2];
int x;
scanf("%s%d",op,&x);
if(*op == 'I')insert(x);
else
{
if(find(x))puts("Yes");
else puts("No");
}
}
return 0;
}
比较简单,不在说明