#include <bits/stdc++.h>
// #include <windows.h>
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define pii pair<int,int> 
#define pli pair<long long,int> 
#define vct vector 
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
// cLL mod[2]={1686688681ll,1666888681ll},base[2]={166686661ll,188868881ll};
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
int rnd(int l,int r) { return rd()%(r-l+1)+l; }
void main_init()
{

}
cint N=105;
int n,m,Q;
string nm[N],nm2[N];
LL mx[N];
int typ[N];
LL Siz[N],siz[N],siz2[N];
struct ST
{
    string s;
    int id;
};
int len[N];
vct <ST> v[N];
unordered_map <ULL,int> mp,mp2,fin[N];
ULL xor_shift(ULL x)
{
    x^=x<<42;
    x^=x>>13;
    x^=x<<16;
    x^=x>>35;
    return x;
}
ULL gths(string &str)
{
    ULL hs=0;
    int ln=sz(str);
    For_(i,0,ln) hs=xor_shift(hs+str[i]);
    return hs;
}
int qry(string &str)
{
    return mp[gths(str)];
}
LL up(LL w1,LL w2)
{
    return (up_div(w1,w2)*w2);
}
void main_solve()
{
    cin>>Q;
    n=4;
    nm[1]="byte",v[1].pb({"byte",1}),Siz[1]=mx[1]=1ll;
    nm[2]="short",v[2].pb({"short",2}),Siz[2]=mx[2]=2ll;
    nm[3]="int",v[3].pb({"int",3}),Siz[3]=mx[3]=4ll;
    nm[4]="long",v[4].pb({"long",4}),Siz[4]=mx[4]=8ll;
    For(i,1,n) mp[gths(nm[i])]=i;
    m=0;
    while(Q--)
    {
        int opt; cin>>opt;
        if(opt==1)
        {
            n++;
            cin>>nm[n]>>len[n];
            mp[gths(nm[n])]=n;
            For_(i,0,len[n])
            {
                ST t; string ty;
                cin>>ty>>t.s;
                fin[n][gths(t.s)]=i;
                t.id=qry(ty);
                Siz[n]=up(Siz[n],mx[t.id]);
                get_max(mx[n],mx[t.id]);
                Siz[n]+=Siz[t.id];
                v[n].pb(t);
            }
            Siz[n]=up(Siz[n],mx[n]);
            cout<<Siz[n]<<' '<<mx[n]<<'\n';
        }
        else if(opt==2)
        {
            string ty;
            m++;
            cin>>ty>>nm2[m];
            mp2[gths(nm2[m])]=m;
            typ[m]=qry(ty);
            // printf("%d\n",typ[m]);
            siz[m]=up(siz2[m-1],mx[typ[m]]);
            cout<<siz[m]<<'\n';
            siz2[m]=siz[m];
            for(auto &i:v[typ[m]])
                siz2[m]=up(siz2[m],mx[i.id])+Siz[i.id];
            // printf("%d:%lld,%lld\n",m,siz[m],siz2[m]);
        }
        else if(opt==3)
        {
            string s; cin>>s; s+='.';
            int ln=sz(s);
            LL w=0ll,w2=0ll; ULL hs=0;
            bool f=true;
            int t=0;
            For_(i,0,ln)
            {
                char c=s[i];
                // printf("> %c\n",c);
                if(c!='.')
                {
                    hs=xor_shift(hs+c);
                    continue;
                }
                if(f)
                {
                    t=mp2[hs];
                    w=siz[t],w2=siz[t];
                    // printf("%lld,%lld\n",w,w2);
                    t=typ[t];
                    // printf("t=%d\n",t);
                    f=false;
                }
                else
                {
                    int t2=fin[t][hs];
                    // printf("%d,%d\n",t,t2);
                    For(i,0,t2)
                    {
                        w=up(w2,mx[v[t][i].id]);
                        w2=w+Siz[v[t][i].id];
                    }
                    w2=w;
                    // printf("> %lld,%lld\n",w,w2);
                    t=v[t][t2].id;
                }
                hs=0;
            }
            cout<<w<<'\n';
        }
        else if(opt==4)
        {
            LL w; cin>>w;
            int stt=1; while(stt<=m&&w>=siz2[stt]) stt++;
            if(stt>m||w<siz[stt])
            {
                cout<<"ERR\n";
                continue;
            }
            // printf("stt=%d\n",stt);
            LL w2=siz[stt],w2_=siz[stt];
            // printf("w=%lld\n",w2);
            int t=typ[stt];
            string ans=nm2[stt];
            while(t>4)
            {
                w2=up(w2,mx[t]);
                // printf("t=%d(%lld)\n",t,Siz[t]);
                // printf("w=%lld\n",w2);
                if(w2>w||w-w2>=Siz[t])
                {
                    cout<<"ERR\n";
                    continue;
                }
                int t2=0;
                string lst;
                for(auto &i:v[t])
                {
                    LL w3=up(w2_,mx[i.id]);
                    exc(w3>w);
                    // printf("i.id=%d\n",i.id);
                    w2_=(w2=w3)+Siz[i.id];
                    // printf("> %lld,%lld\n",w2,w2_);
                    lst=i.s;
                    t2=i.id;
                }
                ans+='.'+lst;
                w2_=w2;
                t=t2;
            }
            // printf("t=%d\n",t);
            // printf("w=%lld\n",w2);
            w2=up(w2,Siz[t]);
            if(w2>w||w-w2>=Siz[t])
            {
                cout<<"ERR\n";
                continue;
            }
            cout<<ans<<'\n';
        }
    }
}
int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    // srand(time(NULL));
    main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/