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

typedef long long LL;

struct Struct {
  LL mx, sum, num;
  vector<LL> start;
  vector<string> type;
  vector<string> name;
};
map<string, LL> len;
map<string, Struct> t;
vector<LL> start;
vector<string> type, name;

void init1(string s) {
  auto &cur = t[s];
  int n = cur.num;
  LL buf = 0, &mx = cur.mx, &sum = cur.sum;
  for (int i = 0; i < n; i++) {
    auto &ss = cur.type[i];
    if (len.find(ss) != len.end()) {
      mx = max(mx, len[ss]);
    } else {
      mx = max(mx, t[ss].mx);
    }
  }
  for (int i = 0; i < n; i++) {
    auto &ss = cur.type[i];
    if (len.find(ss) != len.end()) {
      buf = (buf + len[ss] - 1) / len[ss] * len[ss];
    } else {
      buf = (buf + t[ss].mx - 1) / t[ss].mx * t[ss].mx;
    }
    cur.start[i] = buf;
    if (len.find(ss) != len.end()) {
      buf += len[ss];
    } else {
      buf += t[ss].sum;
    }
  }
  buf = (buf + mx - 1) / mx * mx;
  sum = buf;
}

LL dfs3(string s, string k) {
  if (len.find(s) != len.end() || !k.size()) {
    return 0;
  }
  auto &cur = t[s];
  int n = cur.num;
  int pos = k.find_first_of('.');
  string son = (pos == k.npos ? k : k.substr(0, pos));
  string r = (pos == k.npos ? "" : k.substr(pos + 1, k.size() - pos - 1));
  for (int i = 0; i < n; i++) {
    if (cur.name[i] == son) {
      return cur.start[i] + dfs3(cur.type[i], r);
    }
  }
  assert(0);
  return 0;
}

bool ok = true;
string dfs4(string s, LL k) {
  if (len.find(s) != len.end()) {
    if (len[s] <= k) {
      ok = false;
    }
    return "";
  }
  auto &cur = t[s];
  int n = cur.num;
  for (int i = n - 1; ~i; i--) {
    if (cur.start[i] <= k) {
      k -= cur.start[i];
      string son = cur.type[i];
      return "." + cur.name[i] + dfs4(son, k);
      break;
    }
  }
  ok = false;
  return "";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  len["byte"] = 1;
  len["short"] = 2;
  len["int"] = 4;
  len["long"] = 8;
  int n;
  cin >> n;
  while (n--) {
    int op;
    cin >> op;
    if (op == 1) {
      string s;
      cin >> s;
      cin >> t[s].num;
      int k = t[s].num;
      t[s].start.resize(k);
      t[s].type.resize(k);
      t[s].name.resize(k);
      for (int i = 0; i < k; i++) {
        cin >> t[s].type[i] >> t[s].name[i];
      }
      init1(s);
      cout << t[s].sum << " " << t[s].mx << "\n";
    }
    if (op == 2) {
      string tp, na;
      cin >> tp >> na;
      static LL buf = 0;
      if (len.find(tp) != len.end()) {
        buf = (buf + len[tp] - 1) / len[tp] * len[tp];
      } else {
        buf = (buf + t[tp].mx - 1) / t[tp].mx * t[tp].mx;
      }
      start.push_back(buf);
      type.push_back(tp);
      name.push_back(na);
      cout << buf << "\n";
      if (len.find(tp) != len.end()) {
        buf += len[tp];
      } else {
        buf += t[tp].sum;
      }
    }
    if (op == 3) {
      string s;
      cin >> s;
      int cur = s.find_first_of('.');
      string t = (cur == s.npos ? s : s.substr(0, cur));
      string r = (cur == s.npos ? "" : s.substr(cur + 1, s.size() - cur - 1));
      for (int i = 0; i < start.size(); i++) {
        if (name[i] == t) {
          cout << start[i] + dfs3(type[i], r) << "\n";
          break;
        }
      }
    }
    if (op == 4) {
      LL k;
      cin >> k;
      if (!name.size()) {
        cout << "ERR\n";
        continue;
      }
      ok = true;
      string ans;
      for (int i = 0; i < name.size(); i++) {
        if (start[i] <= k && (i + 1 == name.size() || start[i + 1] > k)) {
          ans = name[i] + dfs4(type[i], k - start[i]);
          break;
        }
      }
      if (!ok) {
        cout << "ERR\n";
      } else {
        cout << ans << "\n";
      }
    }
  }
  return 0;
}