#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include<queue>
#include<string.h>
using namespace std;

int a[10005] = { 0 };
map<int, int>hx;

int main()
{
    int q, op, x, n = 0, sum;
    cin >> q;
    while (q--)
    {
        cin >> op >> x;
        if (op == 5)
        {
            if (hx[x] == 1)continue;
            hx[x] = 1;
            for (int i = n; i >= 0; i--)
            {
                if (i == 0)
                {
                    a[1] = x;
                    break;
                }
                if (x > a[i])
                {
                    a[i + 1] = x;
                    break;
                }
                else a[i + 1] = a[i];
            }
            n++;
        }
        else if (op == 1)
        {
            sum = 0;
            for (int i = 1; i <= n; i++)
            {
                if (x > a[i])sum++;
                else break;
            }
            printf("%d\n", sum + 1);
        }
        else if (op == 2)
        {
            printf("%d\n", a[x]);
        }
        else if (op == 3)
        {
            for (int i = 1; i <= n + 1; i++)
            {
                if (i == n + 1)
                {
                    sum = n;
                    break;
                }
                if (x > a[i]);
                else
                {
                    sum = i - 1;
                    break;
                }
            }
            if (sum >= 1 && sum <= n)printf("%d\n", a[sum]);
            else printf("−2147483647\n");
        }
        else
        {
            for (int i = n; i >= 0; i--)
            {
                if (i == 0)
                {
                    sum = 1;
                    break;
                }
                if (x < a[i]);
                else
                {
                    sum = i + 1;
                    break;
                }
            }
            if (sum >= 1 && sum <= n)printf("%d\n", a[sum]);
            else printf("2147483647\n");
        }
    }
    return 0;
}