import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws FileNotFoundException {

        Set<Integer> set = new HashSet<Integer>();
        Scanner scanner = new Scanner(new FileReader("hashuri.in"));
        PrintWriter writer = new PrintWriter("hashuri.out");

        int operations = Integer.parseInt(scanner.next());
        for ( int i=0; i<operations; i++ ) {
            int operationId = Integer.parseInt(scanner.next());
            int num = Integer.parseInt(scanner.next());
            switch (operationId) {
                case 1:
                    set.add(num);
                    break;
                case 2:
                    set.remove(num);
                    break;
                case 3:
                    writer.println(set.contains(num)? 1 : 0);
                    break;
            }
        }
        scanner.close();
        writer.close();
    }
}


//class Hash {
//
//    private LinkedList<Integer>[] hashTable;
//    private int size;
//
//    Hash(int size) {
//        hashTable = new LinkedList[size];
//        this.size = size;
//    }
//
//    public void add(int num) {
//        int hashCode = num % size;
//        if ( hashTable[hashCode] == null ) {
//            hashTable[hashCode] = new LinkedList<Integer>();
//        }
//        hashTable[hashCode].addFirst(num);
//    }
//
//    public void delete(int num) {
//        int hashCode = num % size;
//        if ( hashTable[hashCode] != null ) {
//            Iterator<Integer> i = hashTable[hashCode].iterator();
//            while (i.hasNext()) {
//                if ( i.next() == num ) {
//                    i.remove();
//                    break;
//                }
//            }
//        }
//    }
//
//    public int contains(int num) {
//        int hashCode = num % size;
//        if ( hashTable[hashCode] != null ) {
//            for ( Integer i :  hashTable[hashCode] ) {
//                if ( i == num ) {
//                    return 1;
//                }
//            }
//        }
//        return 0;
//    }
//}