#include <bits/stdc++.h>


using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 1 << 29;
const ll INFL = 1LL << 60;
const ll mod = 1000000007;





int main() {
	int n;
	cin >> n;
	vector<vector<string>> v(25);
	VI w(25, -1);
	VVB che(25, VB(25, false));

	REP(_, n) {
		int a;
		cin >> a;
		if (a == 2) {
			int b;
			cin >> b;
			b--;
			w[b] = -1;
			REP(i, 25)che[b][i] = false;
		}
		else if (a == 1) {
			string s;
			cin >> s;
			int ans = -2;
			REP(i, 20) {
				if (ans != -2)break;
				if (w[i] != -1) {
					REP(j, w[i]) {
						if (v[i][j] == s && che[i][j]) {
							che[i][j] = false;
							ans = i;
							break;
						}
					}
				}
			}
			cout << ans+1 << endl;
		}
		else {
			int aa;
			cin >> aa;
			aa--;
			int m;
			cin >> m;
			w[aa] = m;
			REP(i, m) {
				string s;
				cin >> s;
				v[aa].push_back(s);
				che[aa][i] = true;
			}
		}
	}
}