#include <iostream>
#include <fstream>

using namespace std;

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

long Q[200010],min1=1000000001;
int i,j,n,m,k,t,p,x,y,r;

int main()
{
    f>>n;
    while(n!=0)
    {
        f>>x;
        if(x==1)
        {
            f>>y;
            Q[++Q[0]]=y;
        }
        else
            if(x==2)
            {
                f>>y;
                for(int i=y;i<Q[0];i++)
                    Q[i]=Q[i+1];
                Q[0]--;
            }
            else
                if(x==3)
                {
                    min1=100000001;
                    for(int i=1;i<=Q[0];i++)
                        min1=min(min1,Q[i]);
                        g<<min1<<"\n";
                }
        n--;
    }
    return 0;
}