#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=2e5,M=9e3;
int a[N],b[N],p[N];char O[9],P[M][M];
int Q(int x,int y){return!a[y]||P[a[x]][a[y]];}
void pb(int x){if(x&&a[x])b[++m]=a[x];}
void pc(int x){pb(x);pb(x*2);pb(x*2+1);}
void mv(int x,int y){swap(a[x],a[y]);p[a[x]]=x;p[a[y]]=y;}
#define h(u,P)for(int x=p,y,z;(y=x/2,z=x*2+Q(x*2+1,x*2),(x&&x<=n))&&P;x=u)
void fl(int p){
	h(y,1)pc(x);h(z,1)pc(x);
	sort(b+1,b+m+1);m=unique(b+1,b+m+1)-b-1;
	cout<<m;f(i,1,m)cout<<" "<<b[i];cout<<endl;
	f(i,1,m)cin>>b[i];
	f(i,1,m)f(j,i,m)P[b[i]][b[j]]=1;m=0;
	h(z,Q(z,x))mv(x,z);
	h(y,Q(x,y))mv(x,y);
}
signed main(){
	cin>>s;a[0]=s+1;
	f(_,1,s*2){
		cin>>O>>l;
		if(O[0]=='a'){
			a[p[l]=++n]=l;fl(n);
		}else{
			mv(l=p[l],n);a[n]=0;pc(n--);
			fl(l);
		}
		cout<<(n?a[1]:-1)<<endl;
	}
	return 0;
}