//
//  main.cpp
//  Heapuri
//
//  Created by Ioana Teoc on 9/16/12.
//  Copyright (c) 2012 Ioana Teoc. All rights reserved.
//

#include <iostream>
#include <fstream>

using namespace std;

ifstream f("heapuri.in");
ofstream g("heapuri.out");
#define MAXN 200010

int Heap[MAXN], Pos[MAXN], A[MAXN], n, heapSize;

void citeste(){
    f>>n;
}
void up(int i){
    if(i == 1) return;
    if(A[Heap[i]] < A[Heap[i/2]]){
        swap(Pos[Heap[i]], Pos[Heap[i/2]]);
        swap(Heap[i], Heap[i/2]);
        up(i/2);
    }
}

void down(int i){
    int min = i;
    int dr = 2*i;
    int st = 2*i+1;
    if(st <= heapSize && A[Heap[st]] < A[Heap[min]])
        min = st;
    if(dr <= heapSize && A[Heap[dr]] < A[Heap[min]])
        min = dr;
    if(min == i) return;
    swap(Pos[Heap[i]], Pos[Heap[min]]);
    swap(Heap[i], Heap[min]);
    down(min);
}

void push(int x){
    ++heapSize;
    ++A[0];
    A[A[0]] = x;
    Pos[A[0]] = heapSize;
    Heap[heapSize] = A[0];
    up(heapSize);
}

void pop(int x){
    int i = Pos[x];
    Pos[Heap[heapSize]] = Pos[Heap[i]];
    Heap[i] = Heap[heapSize];
    --heapSize;
    int nod = Pos[Heap[i]];
    if(nod > 1 && A[Heap[nod]] < A[Heap[nod/2]]){
        up(nod);
    }
    else
        down(nod);
}

void rezolva(){
    int op, x;
    for(int i = 1; i <= n; ++i){
        f >> op;
        if(op == 1){
            f >> x;
            push(x);
        }
        else if (op == 2){
            f >> x;
            pop(x);
        }
        else {
            g << A[Heap[1]] << endl;
        }
        
    }
    
}

int main()
{
    citeste();
    rezolva();
    f.close();
    g.close();
    return 0;
}