#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(ll i=(n);i<(m);i++)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) for(ll i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using PP=pair<ll,P>;
using vp=vector<P>;
using vpp=vector<PP>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
int main(){
    int n;
    cin>>n;
    vector<map<string,int>>vec(20);
    REP(i,n){
        int t;
        cin>>t;
        if(t==0){
            int a,b;
            cin>>a>>b;
            a--;
            REP(j,b){
                string st;
                cin>>st;
                vec[a][st]++;
            }
        }else if(t==1){
            string st;
            cin>>st;
            bool f=false;
            REP(i,20){
                if(vec[i].find(st)!=vec[i].end()){
                    vec[i][st]--;
                    if(!vec[i][st]){
                        vec[i].erase(st);
                    }
                    f=true;
                    cout<<i+1<<endl;
                    break;
                }
            }
            if(!f){
                cout<<"-1"<<endl;
            }
        }else{
            int a;
            cin>>a;
            a--;
            vec[a].clear();
        }
    }
    return 0;
}