#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}

struct data{
  map<string,int> mp;
};

int main()
{
  data dat[21];
  int N,f,seki,num,flag;
  string neta;
  cin >> N;
  for(int I=0;I<N;I++){
    cin >> f;
    switch(f){
    case 0:
      cin >> seki >> num;
      REP(i,num){
        cin >> neta;
        (dat[seki].mp[neta])++;
      }
      break;
    case 1:
      cin >> neta;
      flag = 1;
      REP(i,20){
        if(dat[i+1].mp[neta] != 0){
          (dat[i+1].mp[neta])--;
          cout << i+1 << endl;
          flag =0;
          break;
        }
      }
      if(flag)
        cout << -1 << endl;
      break;
    case 2:
      cin >> flag;
      dat[flag].mp.clear();
      break;
    }



  }
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}