#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;

template<typename T>
class List{
private:
    typedef unsigned long ul;
    
    struct node{
        node* front;
        node* back;
        T a;
    };
    
    ul Size;
    node* root;
    
    node* create(T a){
        node* New=(node*)malloc(sizeof(node));
        assert(New!=NULL);
        (*New).a=a;
        return New;
    }
    
public:
    struct iterator{
        node* where;
        
        iterator(node* where):where(where){}
        
        iterator(T* t){
            char* C=(char*)t;
            C-=2*sizeof(node*);
            where=(node*)C;
        }
        
        iterator & operator ++ (){
            where=(*where).back;
            return *this;
        }
        
        iterator & operator -- (){
            where=(*where).front;
            return *this;
        }
        
        iterator operator ++ (int){
            iterator ret=*this;
            where=(*where).back;
            return ret;
        }
        
        iterator operator -- (int){
            iterator ret=*this;
            where=(*where).front;
            return ret;
        }
        
        bool operator == (const iterator &I) const {
            return where==I.where;
        }
        
        bool operator != (const iterator &I) const {
            return where!=I.where;
        }
        
        T & operator * (){
            return (*where).a;
        }
        
        T* pointer(){
            return &(*where).a;
        }
    };
    
    List(){
        Size=0;
        root=create(T());
        (*root).back=root;
        (*root).front=root;
    }
    
    iterator begin(){return iterator((*root).back);}
    
    iterator end(){return iterator(root);}
    
    ul size(){return Size;}
    
    iterator push_back(T a){
        node* New=create(a);
        node* F=(*root).front;
        (*F).back=New;
        (*New).front=F;
        (*root).front=New;
        (*New).back=root;
        Size++;
        return iterator(New);
    }
    
    iterator push_front(T a){
        node* New=create(a);
        node* B=(*root).back;
        (*root).back=New;
        (*New).front=root;
        (*B).front=New;
        (*New).back=B;
        Size++;
        return (New);
    }
    
    iterator pop_back(){
        if(Size==0){return root;}
        node* E=(*root).front;
        node* F=(*E).front;
        (*F).back=root;
        (*root).front=F;
        free(E);
        Size--;
        return iterator(root);
    }
    
    iterator pop_front(){
        if(Size==0){return root;}
        node* E=(*root).back;
        node* B=(*E).back;
        (*B).front=root;
        (*root).back=B;
        free(E);
        Size--;
        return iterator(B);
    }
    
    iterator erase(iterator where){
        node* E=where.where;
        if(Size==0 || E==root){return iterator(root);}
        node* F=(*E).front;
        node* B=(*E).back;
        (*F).back=B;
        (*B).front=F;
        free(E);
        Size--;
        return B;
    }
    
    iterator erase(T* where){
        return erase(iterator(where));
    }
    
    iterator erase(node* E){
        if(Size==0 || E==root){return iterator(root);}
        node* F=(*E).front;
        node* B=(*E).back;
        (*F).back=B;
        (*B).front=F;
        free(E);
        Size--;
        return B;
    }
};

template<typename T,typename U>
class treap{
private:
    struct node{
        ll priority;
        T key;
        U a;
        node *parent;
        node *right;
        node *left;
    };
    
    random_device r;
    mt19937 mt;
    List<node> tree;
    node* root;
    node leaf={0,T(),U(),NULL,NULL,NULL};
    ll Size;
    
    node* search(T key){
        if(Size==0){return err();}
        node* where=root;
        while(1){
            if((*where).key==key){return where;}
            if((*where).right!=err() && (*where).key<key){where=(*where).right; continue;}
            if((*where).left!=err() && key<(*where).key){where=(*where).left; continue;}
            return where;
        }
        return err();
    }
    
    node* err(){return &leaf;}
    
    ll mk_pr(){
        uniform_int_distribution<int> R(1,1000000000);
        return R(mt);
    }
    
    void parent_change(node &P,node* from,node* to){
        if(P.right==from){P.right=to; return;}
        else if(P.left==from){P.left=to; return;}
        assert(false);
    }
    
    void parent_change(node* P,node* from,node* to){parent_change(*P,from,to);}
    
    node* rotateL(node &where){
        node* right=where.right;
        assert(right!=err());
        node* L=(*right).left;
        if(L!=err()){
            where.right=L;
            (*L).parent=&where;
        }
        else{where.right=err();}
        (*right).left=&where;
        if(where.parent==err()){
            root=right;
            (*right).parent=err();
        }
        else{
            (*right).parent=where.parent;
            parent_change((*right).parent,&where,right);
        }
        where.parent=right;
        return right;
    }
    
    node* rotateR(node &where){
        node* left=where.left;
        assert(left!=err());
        node* R=(*left).right;
        if(R!=err()){
            where.left=R;
            (*R).parent=&where;
        }
        else{where.left=err();}
        (*left).right=&where;
        if(where.parent==err()){
            root=left;
            (*left).parent=err();
        }
        else{
            (*left).parent=where.parent;
            parent_change((*left).parent,&where,left);
        }
        where.parent=left;
        return left;
    }
    
    node* rotate(node &where){
        node* P=where.parent;
        if(P!=err() && (*P).priority<where.priority){
            if((*P).right==&where){rotateL(*P);}
            else{rotateR(*P);}
        }
        return &where;
    }
    
    node* rotate(node *where){
        return rotate(*where);
    }
    
    node* Max(node* where){
        assert(where!=err());
        while(1){
            if((*where).right==err()){return where;}
            where=(*where).right;
        }
        return err();
    }
    
    node* Min(node* where){
        assert(where!=err());
        while(1){
            if((*where).left==err()){return where;}
            where=(*where).left;
        }
        return err();
    }
    
    node* erase(node* where){
        if((*where).right!=err() && (*where).left!=err()){
            node* ers=Min((*where).right);
            (*where).key=(*ers).key;
            (*where).a=(*ers).a;
            erase(ers);
            return where;
        }
        node* ret;
        if((*where).right==err() && (*where).left==err()){
            if(where==root){root=err(); return err();}
            parent_change((*where).parent,where,err());
            ret=(*where).parent;
            tree.erase(where);
        }
        else if((*where).right!=err()){
            if(where==root){
                root=(*where).right;
                (*(*where).right).parent=err();
                tree.erase(where);
                return root;
            }
            parent_change((*where).parent,where,(*where).right);
            (*(*where).right).parent=(*where).parent;
            ret=(*where).parent;
            tree.erase(where);
        }
        else{
            if(where==root){
                root=(*where).left;
                (*(*where).left).parent=err();
                tree.erase(where);
                return root;
            }
            parent_change((*where).parent,where,(*where).left);
            (*(*where).left).parent=(*where).parent;
            ret=(*where).parent;
            tree.erase(where);
        }
        return ret;
    }
    
public:
    treap():mt(r()){
        Size=0;
        root=err();
    }
    
    void insert(T key,U a){
        if(Size==0){
            tree.push_front({mk_pr(),key,a,err(),err(),err()});
            Size++;
            root=&(*tree.begin());
            return;
        }
        node* where=search(key);
        if((*where).key==key){(*where).a=a;}
        else{
            tree.push_front({mk_pr(),key,a,where,err(),err()});
            node* New=&(*tree.begin());
            if((*where).key<key){(*where).right=New;}
            else{(*where).left=New;}
            while(New!=err()){
                New=rotate(New);
                New=(*New).parent;
            }
            Size++;
        }
    }
    
    U* find(T key){
        if(Size==0){return end();}
        node* where=search(key);
        if((*where).key==key){return &(*where).a;}
        return end();
    }
    
    U* end(){return &leaf.a;}
    
    ll size(){return Size;}
    
    U* erase(T key){
        node* where=search(key);
        if(where==err()){return end();}
        if((*where).key!=key){return end();}
        Size--;
        return &(*erase(where)).a;
    }
    
    void print(){
        if(Size==0){return;}
        dfs(root);
    }
    
    void dfs(node* where){
        assert(where!=err());
        cout<<(*where).key<<" "<<(*where).priority<<endl;
        if((*where).right!=err()){dfs((*where).right);}
        if((*where).left!=err()){dfs((*where).left);}
    }
    
    void test(){
        mid_dfs(root);
        cout<<endl;
        first_dfs(root);
        cout<<endl;
    }
    
    void mid_dfs(node* where){
        assert(where!=err());
        if((*where).left!=err()){mid_dfs((*where).left);}
        cout<<" "<<(*where).a;
        if((*where).right!=err()){mid_dfs((*where).right);}
    }
    
    void first_dfs(node* where){
        assert(where!=err());
        cout<<" "<<(*where).a;
        if((*where).left!=err()){first_dfs((*where).left);}
        if((*where).right!=err()){first_dfs((*where).right);}
    }
};



int main(){
    treap<ll,ll> T;
    ll q;
    cin>>q;
    while(q--){
        ll com;
        cin>>com;
        if(com==0){
            ll x;
            cin>>x;
            T.insert(x,x);
            cout<<T.size()<<endl;
        }
        else if(com==1){
            ll x;
            cin>>x;
            if(T.find(x)==T.end()){cout<<0<<endl;}
            else{cout<<1<<endl;}
        }
        else{
            ll x;
            cin>>x;
            T.erase(x);
        }
    }
    
    
    return 0;
}



Measured memory_bytes: 18664