#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;
const int MAXN = 100001;

mt19937 my_rand(163721);

struct node {
    int x, y = my_rand(), size = 0;
    node *l, *r;
    node() {
        x = INF;
        l = r = nullptr;
        size = 1;
    }
};

typedef node* pnode;
typedef pair<pnode, pnode> Pair;

vector<node> a(MAXN);
int ind = 0;

pnode root = nullptr;

void recalc(pnode a) {
    if (!a) return;
    a->size = 1;
    if (a->l) a->size += a->l->size;
    if (a->r) a->size += a->r->size;
}

pnode merge(pnode a, pnode b) {
    if (!a) return b;
    if (!b) return a;
    if (a->y > b->y) {
        a->r = merge(a->r, b);
        recalc(a);
        return a;
    } else {
        b->l = merge(a, b->l);
        recalc(b);
        return b;
    }
}

void split(pnode a, int x, pnode &l, pnode &r) {
    if (!a) {
        l = r = nullptr;
        return;
    }
    if (a->x > x) {
        split(a->l, x, l, r);
        a->l = r;
        recalc(a);
        r = a;
    } else {
        split(a->r, x, l, r);
        a->r = l;
        recalc(a);
        l = a;
    }
}

void add(int x) {
    Pair q;
    split(root, x, q.first, q.second);
    pnode t = &a[ind++];
    t->size = 1;
    t->x = x;
    root = merge(q.first, merge(t, q.second));
}

// split: x](

void kth(pnode a, int k) {
//    cout << "kth: " << k << "\n";
    if (!a) exit(0);
    if (k == 1) {
        cout << a->x << "\n";
        return;
    }
    if (k > (a->l ? a->l->size : 0)) {
        return kth(a->r, k - (a->l ? a->l->size : 0) - 1);
    } else {
        return kth(a->l, k);
    }
}

void del(int x) {
    Pair q, q1;
    split(root, x, q.first, q.second);
    split(q.first, x - 1, q1.first, q1.second);
    root = merge(q1.first, q.second);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    string s;
    int x;
    Pair q;
    for (int i = 0; i < n; i++) {
        cin >> s >> x;
        if (s == "1" || s == "+1") {
            add(x);
        } else if (s == "0") {
//            if (root == nullptr) {
//                cout << "root is null\n";
//                return 1;
//            }
            kth(root, root->size - x + 1);
        } else {
            del(x);
        }
//        for (int i = 0; i < ind; i++) {
//            cout << a[i].x << " " << a[i].y << " " << a[i].size << "\n";
//        }
    }
}
/*
11
+1 5
+1 3
+1 7
*/