import heapq

n_queries = int(input())
heap = []

for _ in range(n_queries):
    line = input().split(" ")
    if len(line) == 2:
        op, el = int(line[0]), int(line[1])
    else:
        op = int(line[0])
    if op == 1:
        heapq.heappush(heap, el)
    if op == 2:        
        index = heap.index(el)
        heap[index] = heap[-1]
        heap.pop()
        heapq.heapify(heap)
    if op == 3:
        print(heap[0])

 Scanner input = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>();
        while(input.hasNext()){
            int q=input.nextInt();
            if(q==1){
               pq.offer(input.nextInt()); 
            }
            if(q==2){
               pq.remove(input.nextInt());
               
            }
            if(q==3)
            System.out.println(pq.peek());
        }
        input.close();

class Heap {
    constructor() {
        this.heap = [];
        this.pushCount = Number.MIN_SAFE_INTEGER;
    }
		
		percUp(index) {
        let p;
        while (index > 0 && smaller(this.heap[index], this.heap[p = parent(index)])) {
            let t = this.heap[index];
            this.heap[index] = this.heap[p];
            this.heap[p] = t;
            index = p;
        }
    }

    percDown(index) {
        let l;

        while ((l = leftChi(index)) < this.heap.length) {
            if (l + 1 < this.heap.length && smaller(this.heap[l + 1], this.heap[l])) {
                l = l + 1;
            }

            if (smaller(this.heap[index], this.heap[l])) {
                break;
            }

            let t = this.heap[index];
            this.heap[index] = this.heap[l];
            this.heap[l] = t;

            index = l;
        }
    }

    push(node) {
        node.pushCount = ++this.pushCount;
        this.heap.push(node);
        this.percUp(this.heap.length - 1);
    }

    toArray() {
      return this.heap;
    }

    *[Symbol.iterator]() {
        for (let i = 0; i < this.heap.length; i++) {
            yield this.heap[i].data;
        }
    }

    remove(value) {
        let j = 0;
        for (let i = 0; i < this.heap.length; i++) {
            if (value !== this.heap[i].priority) {
                this.heap[j] = this.heap[i];
                j++;
            }
        }

        this.heap.splice(j);

        for (let i = parent(this.heap.length - 1); i >= 0; i--) {
            this.percDown(i);
        }

        return this;
    }
}

function leftChi(i) {
    return (i << 1) + 1;
}

function parent(i) {
    return (i + 1 >> 1) - 1;
}

function smaller(x, y) {
    if (x.priority !== y.priority) {
        return x.priority < y.priority;
    } else {
        return x.pushCount < y.pushCount;
    }
}

function processData(input) {
    //Enter your code here
    const heap = new Heap();
    const arr = input.split("\n");
    for (let i = 0; i < arr.length; i++) {
        const innerArr = arr[i].split(" ");
        const query = Number(innerArr[0]);
        if (query == 1) {
            const value = Number(innerArr[1]);
            heap.push({
                priority: value
            });
        } else if (innerArr[0] == 2) {
            const value = Number(innerArr[1]);
            heap.push({
                priority: value
            });
            heap.remove(value)
        } else if (innerArr[0] == 3) {
            console.log(heap.toArray()[0].priority);
        }
    }
}