#include <bits/stdc++.h>
using namespace std;
string a[1005][2];
long long yd[1005];
int k=0;
map<string,int>ma;
int main()
{
	//freopen("struct.in","r",stdin);
	//freopen("struct.out","w",stdout);
	int q;
	cin>>q;
	int opt;
	long long add;
	string s;
	string t,n;
	long long nowdd=-1;
	yd[0]=-1;
	for(int i=1;i<=q;i++)
	{
		cin>>opt;
		if(opt==2)
		{
			cin>>t>>n;
			k++;
			ma[n]=k;
			a[k][0]=t;
			a[k][1]=n;
			if(t[0]=='b')nowdd+=1;
			if(t[0]=='s')nowdd+=2;
			if(t[0]=='i')nowdd+=4;
			if(t[0]=='l')nowdd+=8;
			yd[k]=nowdd;
		}
		else if(opt==3)
		{
			cin>>s;
			cout<<yd[ma[s]-1]+1<<'\n';
		}
		else if(opt==4)
		{
			cin>>add;
			int t=lower_bound(yd+1,yd+1+k,add)-yd;
			if(t==k+1)
			{
				cout<<"ERR"<<'\n';
			}
			else
			{
				cout<<a[t][1]<<'\n';
			}
		}
	}
	return 0;
}