#include <cstdio>
#include <set>
#include <cstdlib>
#include <ctime>

using namespace std;

        #ifndef TREAP_H_
        #define TREAP_H_

        #include <limits.h>
        #include <iostream>       // For NULL

        // Treap class
        //
        // CONSTRUCTION: with ITEM_NOT_FOUND object used to signal failed finds
        //
        // ******************PUBLIC OPERATIONS*********************
        // void insert( x )       --> Insert x
        // void remove( x )       --> Remove x
        // Comparable find( x )   --> Return item that matches x
        // Comparable findMin( )  --> Return smallest item
        // Comparable findMax( )  --> Return largest item
        // boolean isEmpty( )     --> Return true if empty; else false
        // void makeEmpty( )      --> Remove all items
        // void printTree( )      --> Print tree in sorted order


          // Node and forward declaration because g++ does
          // not understand nested classes.
        template <class Comparable>
        class Treap;

        template <class Comparable>
        class TreapNode
        {
            Comparable element;
            TreapNode *left;
            TreapNode *right;
            int        priority;

            TreapNode( ) : left( NULL ), right( NULL ), priority( INT_MAX ) { }
            TreapNode( const Comparable & theElement, TreapNode *lt, TreapNode *rt, int pr )
              : element( theElement ), left( lt ), right( rt ), priority( pr )
              { }

            friend class Treap<Comparable>;
        };

        template <class Comparable>
        class Treap
        {
          public:
            explicit Treap( const Comparable & notFound );
            Treap( const Treap & rhs );
            ~Treap( );

            const Comparable & findMin( ) const;
            const Comparable & findMax( ) const;
            const Comparable & find( const Comparable & x ) const;
            bool isEmpty( ) const;
            void printTree( ) const;

            void makeEmpty( );
            void insert( const Comparable & x );
            void remove( const Comparable & x );

            const Treap & operator=( const Treap & rhs );

          private:
            TreapNode<Comparable> *root;
            const Comparable ITEM_NOT_FOUND;
            TreapNode<Comparable> *nullNode;

              // Recursive routines
            void insert( const Comparable & x, TreapNode<Comparable> * & t );
            void remove( const Comparable & x, TreapNode<Comparable> * & t );
            void makeEmpty( TreapNode<Comparable> * & t );
            void printTree( TreapNode<Comparable> *t ) const;

              // Rotations
            void rotateWithLeftChild( TreapNode<Comparable> * & t ) const;
            void rotateWithRightChild( TreapNode<Comparable> * & t ) const;
            TreapNode<Comparable> * clone( TreapNode<Comparable> * t ) const;
        };

        #endif

    #include <iostream>

    /**
     * Implements an unbalanced binary search tree.
     * Note that all "matching" is based on the compares method.
     * @author Mark Allen Weiss
     */
        /**
         * Construct the treap.
         */
        template <class Comparable>
        Treap<Comparable>::Treap( const Comparable & notFound ) :
          ITEM_NOT_FOUND( notFound )
        {
            nullNode = new TreapNode<Comparable>;
            nullNode->left = nullNode->right = nullNode;
            nullNode->priority = INT_MAX;
            root = nullNode;
        }

        /**
         * Copy constructor.
         */
        template <class Comparable>
        Treap<Comparable>::Treap( const Treap<Comparable> & rhs )
          : ITEM_NOT_FOUND( rhs.ITEM_NOT_FOUND )
        {
            nullNode = new TreapNode<Comparable>;
            nullNode->left = nullNode->right = nullNode;
            nullNode->priority = INT_MAX;
            root = nullNode;
            *this = rhs;
        }

        /**
         * Destructor for the tree.
         */
        template <class Comparable>
        Treap<Comparable>::~Treap( )
        {
            makeEmpty( );
            delete nullNode;
        }

        /**
         * Insert x into the tree; duplicates are ignored.
         */
        template <class Comparable>
        void Treap<Comparable>::insert( const Comparable & x )
        {
            insert( x, root );
        }

        /**
         * Remove x from the tree. Nothing is done if x is not found.
         */
        template <class Comparable>
        void Treap<Comparable>::remove( const Comparable & x )
        {
            remove( x, root );
        }

        /**
         * Find the smallest item in the tree.
         * Return smallest item or ITEM_NOT_FOUND if empty.
         */
        template <class Comparable>
        const Comparable & Treap<Comparable>::findMin( ) const
        {
            if( isEmpty( ) )
                return ITEM_NOT_FOUND;

            TreapNode<Comparable> *ptr = root;
            while( ptr->left != nullNode )
                ptr = ptr->left;

            return ptr->element;
        }

        /**
         * Find the largest item in the tree.
         * Return the largest item of ITEM_NOT_FOUND if empty.
         */
        template <class Comparable>
        const Comparable & Treap<Comparable>::findMax( ) const
        {
            if( isEmpty( ) )
                return ITEM_NOT_FOUND;

            TreapNode<Comparable> *ptr = root;
            while( ptr->right != nullNode )
                ptr = ptr->right;

            return ptr->element;
        }

        /**
         * Find item x in the tree.
         * Return the matching item or ITEM_NOT_FOUND if not found.
         */
        template <class Comparable>
        const Comparable & Treap<Comparable>::
        find( const Comparable & x ) const
        {
            TreapNode<Comparable> *current = root;
            nullNode->element = x;

            for( ; ; )
            {
                if( x < current->element )
                    current = current->left;
                else if( current->element < x )
                    current = current->right;
                else if( current != nullNode )
                    return current->element;
                else
                    return ITEM_NOT_FOUND;
            }
        }

        /**
         * Make the tree logically empty.
         */
        template <class Comparable>
        void Treap<Comparable>::makeEmpty( )
        {
            makeEmpty( root );
        }

        /**
         * Test if the tree is logically empty.
         * Return true if empty, false otherwise.
         */
        template <class Comparable>
        bool Treap<Comparable>::isEmpty( ) const
        {
            return root == nullNode;
        }

        /**
         * Print the tree contents in sorted order.
         */
        template <class Comparable>
        void Treap<Comparable>::printTree( ) const
        {
            if( isEmpty( ) )
                cout << "Empty tree" << endl;
            else
                printTree( root );
        }


        /**
         * Deep copy.
         */
        template <class Comparable>
        const Treap<Comparable> &
        Treap<Comparable>::operator=( const Treap<Comparable> & rhs )
        {
            if( this != &rhs )
            {
                makeEmpty( );
                root = clone( rhs.root );
            }

            return *this;
        }

        /**
         * Internal method to insert into a subtree.
         * x is the item to insert.
         * t is the node that roots the tree.
         * Set the new root.
         */
        template <class Comparable>
        void Treap<Comparable>::
        insert( const Comparable & x, TreapNode<Comparable> * & t )
        {
            if( t == nullNode )
                t = new TreapNode<Comparable>( x, nullNode, nullNode,
                                               rand() % 100000000 );
            else if( x < t->element )
            {
                insert( x, t->left );
                if( t->left->priority < t->priority )
                    rotateWithLeftChild( t );
            }
            else if( t->element < x )
            {
                insert( x, t->right );
                if( t->right->priority < t->priority )
                    rotateWithRightChild( t );
            }
            // else duplicate; do nothing
        }

        /**
         * Internal method to remove from a subtree.
         * x is the item to remove.
         * t is the node that roots the tree.
         * Set the new root.
         */
        template <class Comparable>
        void Treap<Comparable>::remove( const Comparable & x,
                                        TreapNode<Comparable> * & t )
        {
            if( t != nullNode )
            {
                if( x < t->element )
                    remove( x, t->left );
                else if( t->element < x )
                    remove( x, t->right );
                else
                {
                        // Match found
                    if( t->left->priority < t->right->priority )
                        rotateWithLeftChild( t );
                    else
                        rotateWithRightChild( t );

                    if( t != nullNode )      // Continue on down
                        remove( x, t );
                    else
                    {
                        delete t->left;
                        t->left = nullNode;  // At a leaf
                    }
                }
            }
        }

        /**
         * Internal method to make subtree empty.
         */
        template <class Comparable>
        void Treap<Comparable>::makeEmpty( TreapNode<Comparable> * & t )
        {
            if( t != nullNode )
            {
                makeEmpty( t->left );
                makeEmpty( t->right );
                delete t;
            }
            t = nullNode;
        }

        /**
         * Internal method to print a subtree in sorted order.
         * @param t the node that roots the tree.
         */
        template <class Comparable>
        void Treap<Comparable>::printTree( TreapNode<Comparable> *t ) const
        {
            if( t != nullNode )
            {
                printTree( t->left );
                cout << t->element << endl;
                printTree( t->right );
            }
        }


        /**
         * Internal method to clone subtree.
         */
        template <class Comparable>
        TreapNode<Comparable> *
        Treap<Comparable>::clone( TreapNode<Comparable> * t ) const
        {
            if( t == t->left )  // Cannot test against nullNode!!!
                return nullNode;
            else
                return new TreapNode<Comparable>( t->element, clone( t->left ),
                                               clone( t->right ), t->priority );
        }

        /**
         * Rotate binary tree node with left child.
         */
        template <class Comparable>
        void Treap<Comparable>::rotateWithLeftChild( TreapNode<Comparable> * & k2 ) const
        {
            TreapNode<Comparable> *k1 = k2->left;
            k2->left = k1->right;
            k1->right = k2;
            k2 = k1;
        }

        /**
         * Rotate binary tree node with right child.
         */
        template <class Comparable>
        void Treap<Comparable>::rotateWithRightChild( TreapNode<Comparable> * & k1 ) const
        {
            TreapNode<Comparable> *k2 = k1->right;
            k1->right = k2->left;
            k2->left = k1;
            k1 = k2;
        }


int N, NR;

int main()
{
    srand( time( NULL ) );

    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);

    int i, tip, x;

    const int ITEM_NOT_FOUND = -999999999;
    Treap<int> TR( ITEM_NOT_FOUND );

    scanf("%d ", &N);

    for (i = 1; i <= N; i++)
    {
        scanf("%d %d ", &tip, &x);

        if (tip == 1 && TR.find( x ) == ITEM_NOT_FOUND ) TR.insert( x );
        if (tip == 2) TR.remove(x);
        if (tip == 3) printf("%d\n", TR.find(x) != ITEM_NOT_FOUND);
    }

    return 0;
}