#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
struct elem
    {
        int nr;
        int ordine=0;
    };
    elem v[1000];
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);

    int n,num=1,j,minim,i;
    cin>>n;
    int cod;
    int x;
    int contor=0;
    for(i=0; i<n; i++)
    {
        cin>>cod;
        if(cod!=3)
        {
            cin>>x;
            if(cod==1)

                {
                    v[contor].nr=x;
                    v[contor].ordine=num;
                    num++;
                    contor++;

                }
                if(cod==2)
                {
                    for(j=0;j<contor;j++)
                    {
                        if(x==v[j].ordine)
                        {
                            for(int q=j;q<contor;q++)
                            {
                                v[q]=v[q+1];
                            }
                            contor--;
                        }
                    }
                }

            }


        else
        {

            minim=v[0].nr;
            for(j=1;j<contor;j++)
            {
                if(minim>v[j].nr)
                    minim=v[j].nr;

            }
             cout<<minim<<'\n';
        }

    }

}