#include<iostream>
#include<cstring>
using namespace std;
const int N = 200003, null = 0x3f3f3f3f;
int h[N];
int find(int x){ //查找到x值应该存放的位置
int k = (x % N + N) % N;
while(h[k] != null && h[k] != x){ //如果该位置有人了就向后移一位
k++;
if(k == N)
k = 0;
}
return k;
}
int main(){
int n;
cin>>n;
char op;
int a;
memset(h, null, sizeof h);
while(n--){
cin>>op>>a;
int k = find(a);
if(op == 'I'){
h[k] = a;
}else{
if(h[k] == null)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
}
return 0;
}