#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define LL long long

 #define rg register

 #define N 500010

 using namespace std;

 int n,m,cnt,top,b[N],t[N],ans[N];

 struct rec{

     int num,pos;

 }a[N];

 struct que{

     int opt,num;

 }q[N];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 inline void add(int x,int y){for(;x<=n;x+=x&-x)t[x]+=y;}

 inline int query(int x){int ret=;for(;x;x-=x&-x)ret+=t[x]; return ret;}

 inline int search(int x){

     int l=,r=n;

     while(l+<r){

         int mid=(l+r)>>;

         if(query(mid)>=x) r=mid; else l=mid;

     }

 //    printf("l=%d r=%d\n",l,r);

     return r;

 }

 inline bool cmp(rec a,rec b){return a.num<b.num;}

 int main(){

     n=read();

     for(rg int i=;i<=n;i++) a[i].num=read();

     m=read();

     for(rg int i=;i<=m;i++){

         char c=getchar();

         while(c!='a'&&c!='m') c=getchar();

         if(c=='a'){

             q[i].opt=,q[i].num=a[++n].num=read();

             a[n].pos=i;

         }

         else q[i].opt=;

     }

     sort(a+,a++n,cmp);

     for(rg int i=;i<=n;i++) add(i,);

     for(rg int i=;i<=n;i++)if(a[i].pos) b[a[i].pos]=i;

 //    printf("n=%d\n",n);

     for(rg int i=m;i;i--){

         if(q[i].opt==){

             add(b[i],-); cnt++;

         }

         else ans[++top]=a[search((n-cnt)/+(n-cnt)%)].num;

     }

     while(top) printf("%d\n",ans[top--]);

     return ;

 }