#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int m;
    cin >> m;
    
    unordered_map<string, int> tmp{{"byte", 0}, {"short", 1}, {"int", 2}, {"long", 3}};//type name to index
    struct Type {
        ll sz;//size
        ll req;//align requirement
        unordered_map<string, int> mp;//son name to idx
        struct Node {
            int tp;//which type
            ll offset;//address offset
        };
        vector<Node> info;//info for each son
    };
    vector<Type> Tinfo{{1ll, 1ll, {}, {}}, {2ll, 2ll, {}, {}}, {4ll, 4ll, {}, {}}, {8ll, 8ll, {}, {}}};//every type info
    int tcnt = 3;

    unordered_map<string, int> emp;
    struct Element {
        int tp;//which type
        ll addr;//starting address
    };
    vector<Element> Einfo;
    int ecnt = -1;
    
    ll lastsz = -1, nowa = 0;
    while (m--) {
        int opt;
        cin >> opt;
        if (opt == 1) {
            string name; int k;
            cin >> name >> k;
            Type news{};
            news.info.resize(k);
            ll presz = -1;
            for (int i = 0; i < k; ++i) {
                string tname, name;
                cin >> tname >> name;
                news.mp[name] = i;
                int tp = tmp[tname];
                news.info[i].tp = tp;
                if (i) {
                    news.info[i].offset = (news.info[i - 1].offset + presz + Tinfo[tp].req - 1) / Tinfo[tp].req * Tinfo[tp].req;
                }
                presz = Tinfo[tp].sz;
            }
            for (auto &i : news.info) {
                news.req = max(news.req, Tinfo[i.tp].req);
            }
            news.sz = (news.info.back().offset + presz + news.req - 1) / news.req * news.req;
            cout << news.sz << ' ' << news.req << '\n';
            tmp[name] = ++tcnt;
            Tinfo.emplace_back(move(news));
        } else if (opt == 2) {
            string tname, name;
            cin >> tname >> name;
            int tp = tmp[tname];
            if (lastsz != -1) {
                nowa = (nowa + lastsz + Tinfo[tp].req - 1) / Tinfo[tp].req * Tinfo[tp].req;
            }
            Einfo.push_back({tp, nowa});
            cout << nowa << '\n';
            lastsz = Tinfo[tp].sz;
            emp[name] = ++ecnt;
        } else if (opt == 3) {
            string str;
            cin >> str;
            ll addr = -1; int nowtp = -1;
            for (int i = 0; ; ) {
                int nxt = str.find('.', i);
                string name = str.substr(i, nxt - i);       
                if (addr == -1) {
                    int eidx = emp[name];
                    nowtp = Einfo[eidx].tp;
                    addr = Einfo[eidx].addr;
                } else {
                    int tidx = Tinfo[nowtp].mp[name];
                    addr += Tinfo[nowtp].info[tidx].offset;
                    nowtp = Tinfo[nowtp].info[tidx].tp;
                }
                if (nxt == string::npos) {
                    break;
                }
                i = nxt + 1;
            }
            cout << addr << '\n';
        } else {
            ll addr;
            cin >> addr;
            bool flag = false;
            for (auto &i : emp) {
                vector<string> vec{i.first};
                auto dfs = [&](auto &self, int nowtp, ll nowAddr) {
                    if (nowtp < 4 && nowAddr <= addr && addr <= nowAddr + (1 << nowtp) - 1) {
                        return true;
                    }
                    for (auto &j : Tinfo[nowtp].mp) if (nowAddr + Tinfo[nowtp].info[j.second].offset <= addr && addr <= nowAddr + Tinfo[nowtp].info[j.second].offset + Tinfo[nowtp].sz - 1) {
                        vec.emplace_back(j.first);
                        if (self(self, Tinfo[nowtp].info[j.second].tp, nowAddr + Tinfo[nowtp].info[j.second].offset)) {
                            return true;
                        }
                        vec.pop_back();
                    }
                    return false;
                };
                if (dfs(dfs, Einfo[i.second].tp, Einfo[i.second].addr)) {
                    for (int j = 0; j + 1 < vec.size(); ++j) {
                        cout << vec[j] << '.';
                    }
                    cout << vec.back() << '\n';
                    flag = true;
                    break;
                }
            }
            if (!flag) {
                cout << "ERR\n";
            }
        }
    }
    return 0;
}