#include <bits/stdc++.h>
using namespace std;
int n;
map<string,pair<int,int> > mp;
map<string,vector<pair< pair<string,string> , pair<int,int> > > > opr;
bool is[810];
int main()
{
	mp["byte"]={1,1};
	mp["short"]={2,2};
	mp["int"]={4,4};
	mp["long"]={8,8};
	cin >> n;
	for(int i=0;i<n;i++)
	{
		int op;
		cin >> op;
		string lei,num,name;
		int l,dui=0,take=0;
		if(op==1){
			cin >> name >> l;
			take=0;
			dui=0;
			for(int k=0;k<l;k++){
				cin >> lei >> num;
				int bei=1;
				dui=max(dui,mp[lei].second);
				while(is[mp[lei].first*bei]){
					bei++;
				}
				for(int j=mp[lei].first*(bei-1);j<mp[lei].first*bei;j++){
					is[j]==true;
				}
				take=max(take,mp[lei].first*bei);
				opr[name].push_back({make_pair(lei,num),{mp[lei].first*(bei-1),mp[lei].first*bei-1}});
				if(opr[lei].size()>0){
					opr[lei].push_back({make_pair(lei,num),{mp[lei].first*(bei-1),mp[lei].first*bei-1}});
				}
			}
			if(take%dui!=0){
				int k=1;
				while(dui*k<take)k++;
				take=dui*k;
			}
			mp[name]={take,dui};
			cout << take << " " << dui << endl;
		}
		else if(op==2){
			string t,n1;
			cin >> t >> n1;
			int bei=1;
			vector<pair< pair<string,string> , pair<int,int> > > p=opr[t];
			for(int j=0;j<p.size();j++){
				string lei=p[j].first.first;
				bei=1;
				dui=max(dui,mp[lei].second);
				while(is[mp[lei].first*bei]){
					bei++;
				}
				for(int j=mp[lei].first*(bei-1);j<mp[lei].first*bei;j++){
					is[j]==true;
				}
				take=max(take,mp[lei].first*bei);
			}
			int j=0;
			opr[t].push_back({{t,n1},{mp[lei].first*(bei-1),mp[lei].first*bei}});
			opr[n1].push_back({{t,n1},{mp[lei].first*(bei-1),mp[lei].first*bei}});
			while(!is[j])j++;
			cout << j << endl;
		}
		else if(op==3){
			string s;
			cin >> s;
			vector<string> vec;
			string s1="";
			for(int j=0;j<s.size();j++){
				if(s[j]=='.'){
					vec.push_back(s1);
					s1="";
				}
				else{
					s1+=s[j];
				}
			}
			int j=0;
			int ans=0;
			while(j<vec.size())
			{
				for(int k=0;k<opr[vec[j]].size();k++){
					if(opr[vec[j]][k].first.first==vec[j+1]){
						j++;
						if(j==vec.size()){
							ans=opr[vec[j-1]][k].second.first;
						}
					}
				}
			}
			cout << ans << endl;
		}
		else if(op==4){
			long long add;
			cin >> add;
		}
	}
	return 0;
}