#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;
ll inf = 1e18;

//WA

int main(void){
	ll n,cnt=0;
	ll seat[100]={};
	rep(i,100)seat[i]=-1;
	map<string,ll> l[5010];
	cin>>n;
	rep(i,n){
		ll mode;
		cin>>mode;
		if(mode==0){
			ll a,b;
			cin>>a>>b;
			seat[a]=cnt;//cnt番目のlistを持つ客
			rep(j,b){
				string c;
				cin>>c;
				l[cnt][c]++;
			}
			cnt++;
		}else if(mode==1){
			string a;
			bool b=true;
			cin>>a;
			reg(j,1,20){
				if(seat[j]>=0 && l[seat[j]][a]>0){
					l[seat[j]][a]--;
					cout<<j<<endl;
					b=false;
					break;
				}
			}
			if(b)cout<<-1<<endl;
		}else{
			ll a;
			cin>>a;
			seat[a]=-1;
		}
	}
	return 0;
}