// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

// #define int ll

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

using namespace std;

#ifdef LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 2e5 + 20;
#endif

//tg: @galebickosikasa

ostream& operator << (ostream& out, const pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

template<typename T> ostream& operator << (ostream& out, const vector<T>& v) {
    for (auto& x: v) out << x << " ";
    return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

struct tree {
	vector<int> t;
	int size = 0, capacity;

	tree (int n) {
		while ((1<<size) < n) ++size;
		++size;
		size = (1<<size);
		capacity = (size>>1);
		t = vector<int> (size);
	}

	int get (int cur, int k) {
		if (cur * 2 >= size) return cur - capacity;
		if (t[cur * 2] >= k) return get (cur * 2, k);
		return get (cur * 2 + 1, k - t[cur * 2]);
	}

	void add (int i, int x) {
		i += capacity;
		t[i] += x;
		i >>= 1;
		while (i) {
			t[i] = t[i * 2] + t[i * 2 + 1];
			i >>= 1;
		}
	}
};

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n;
	cin >> n;
	vector<pii> kek;
	fr (i, n) {
		string t;
		int x = 0;
		cin >> t;
		if (t == "add") {
			cin >> x;
			kek.pb ({0, x});
		}
		if (t == "min") kek.pb ({1, x});
		if (t == "max") kek.pb ({2, x});
		if (t == "mid") kek.pb ({3, x});
	}
	vector<int> tmp;
	for (auto& x: kek) tmp.pb (x.se);
	sort (all (tmp));
	tmp.resize (unique (all (tmp)) - tmp.begin ());
	for (auto& x: kek) x.se = (int)(lower_bound (all (tmp), x.se) - tmp.begin ());
	int m = sz (tmp);
	tree goo (m);
	int cnt = 0;
	for (auto& t: kek) {
		if (t.fi == 0) {
			goo.add (t.se, 1);
			++cnt;
		} else if (t.fi == 1) {
			int x = goo.get (1, 1);
			cout << tmp[x] << '\n';
			goo.add (x, -1);
			--cnt;
		} else if (t.fi == 2) {
			int x = goo.get (1, cnt);
			cout << tmp[x] << '\n';
			goo.add (x, -1);
			--cnt;
		} else {
			int x = goo.get (1, (cnt + 1) / 2);
			cout << tmp[x] << '\n';
			goo.add (x, -1);
			--cnt;
		}
	}





}