#include <iostream>
#include <fstream>
#include <vector>
#define m 666013
using namespace std;
vector <int> v[m];
int find(int x)
{
    int i;
    for(i=0;i<v[x%m].size();i++)
        if(v[x%m][i] == x)return 1;
    return 0;
}
void ins(int x)
{
    if(find(x)==0)
        v[x%m].push_back(x);
}
void del(int x)
{
    int i;
    for(i=0; i<v[x%m].size();i++)
        if(v[x%m][i]==x)
            v[x%m].erase(v[x%m].begin()+i);
}
int main()
{
    int n,i,p,x;
    fstream f,g;
    f.open("hashuri.in",ios::in);
    g.open("hashuri.out",ios::out);
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>p>>x;
        if(p==1)inserare(x);
        else if(p==2)sterge(x);
        else if(p==3)g<<gasire(x)<<"\n";
    }

}