#include <iostream>
#include <fstream>
#include <bitset>

using namespace std;

ifstream f ("heapuri.in");
ofstream t ("heapuri.out");

template <class _elem, typename is_less_than>
class heap {  /// expects functor
/// compare is expected to return bool value
/// by-default min_heap, change compare function accordingly
 public:
    heap(size_t _size = 1000) {
        max_size = _size;
        storage = new _elem[max_size];
        current_bound = 1;
        current_size = 0;
    }  /// default c-tor

    heap(const heap<_elem, is_less_than> &target) {
        *this = target;
    }  /// copy c-tor

    heap &operator = (const heap<_elem, is_less_than> &target) {
        delete[] storage;
        max_size = target.max_size;
        storage = new _elem[max_size];
        for (unsigned i = 0; i < max_size; ++i)
            storage[i] = target.storage[i];
        current_size = target.current_size;
        current_bound = target.current_bound;
    }  /// copy assgn

    [[gnu::hot]] void add(_elem target) {
        storage[current_bound] = target;
        sift_up(current_bound);
        ++current_bound;
        ++current_size;
    }

    [[gnu::pure]] bool empty() {
        return (current_size > 0);
    }

    [[gnu::pure]] _elem top() {
        return storage[1];
    }

    [[gnu::hot]] _elem pop() {
        unsigned iterator = 1;
        is_less_than comparator;

        _elem retval = storage[1];

        while (!is_leaf(iterator)) {
            if (comparator(left_son(iterator), right_son(iterator)))
                storage[iterator] = left_son(iterator),
                iterator = left_son_pos(iterator);
            else
                storage[iterator] = right_son(iterator),
                iterator = right_son_pos(iterator);
        }

        if (is_leaf(iterator) == -1) {  /// empty right leaf
            /// this case automatically erases last elem
            storage[--current_bound] = storage[iterator];  /// TEST
            --current_size;
        } else {
            heap::swap(storage[iterator], storage[current_bound - 1]);
            --current_bound;
            --current_size;
        }

        return retval;
    }

    void run_diagnostic() {
        for (unsigned i = 1; i < current_bound; ++i)
            std::cout << storage[i] << " ";
        std::cout << std::endl;
    }

    ~heap() {
        delete[] storage;
    }

 private:
    void sift_up(unsigned pos) {
        is_less_than comparator;

        unsigned target = parent_pos(pos);
        if (!target)
            return;
        if (comparator(storage[pos], storage[target])) {
            heap::swap(storage[pos], storage[target]);
            sift_up(target);
        }
    }

    static inline void swap(_elem &first, _elem &second) {
        _elem auxiliary;
        auxiliary = first;
        first = second;
        second = auxiliary;
    }

    [[gnu::hot, gnu::pure]] inline unsigned right_son_pos(unsigned pos) {
        return 1 + (pos << 1);
    }

    [[gnu::hot, gnu::pure]] inline _elem right_son(unsigned pos) {
        return storage[right_son_pos(pos)];
    }

    [[gnu::hot, gnu::pure]] inline unsigned left_son_pos(unsigned pos) {
        return (pos << 1);
    }

    [[gnu::hot, gnu::pure]] inline _elem left_son(unsigned pos) {
        return storage[left_son_pos(pos)];
    }

    [[gnu::hot]] inline unsigned parent_pos(unsigned pos) {
        return (pos >> 1);
    }

    [[gnu::hot]] inline _elem parent(unsigned pos) {
        return storage[parent_pos(pos)];
    }

    [[gnu::hot]] inline int is_leaf(unsigned pos) {
        if (right_son_pos(pos) < current_bound &&
                left_son_pos(pos) < current_bound) {
            return 0;
        } else if (right_son_pos(pos) == current_bound) {  // empty right_leaf
            return -1;
        } else {
            return 1;
        }
    }

    size_t max_size, current_size, current_bound;
    _elem *storage;
};

class integer{
public:
    int elem;
    struct do_compare {
        bool operator () (integer const &a, integer const &b) {
            return a.elem < b.elem;
        }
    };
};

int main() {
    int query, n;
    bitset <200010> vaz;
    f >> n;

    heap<integer, integer::do_compare> h(200010);

    integer maneuver;

    for (int i = 0; i < n; ++i) {
        f >> query;

        switch (query) {
        case 1: {
            f >> query;
            maneuver.elem = query;
            h.add(maneuver);
            break;
        }
        case 2: {
            f >> query;
            vaz[query] = true;
            break;
        }
        case 3: {
            while(vaz[h.top().elem]) {
                h.pop();
            }
            t << h.top().elem << '\n';
            break;
        }
        }
    }

    return 0;
}