#include <bits/stdc++.h>

using namespace std;

const int N = 40005;

int a[N], b[N], res[N], id[N];
vector<int> G[N];
int siz[N], son[N], f[20][1 << 14], g[1 << 14];

void upd(int *F, int A, int B) {
    memcpy(g, F, sizeof(g));
    for (int i = 0; i < 1 << 14; ++i) F[i] = min(F[i] + B, g[i ^ A]);
}

void dfs1(int x) {
    siz[x] = 1;
    for (auto v : G[x]) dfs1(v), siz[x] += siz[v], ((!son[x] || siz[v] > siz[son[x]]) && (son[x] = v));
}

void dfs2(int x, int y = 0) {
    res[x] = f[y][0];
    for (auto v : G[x]) {
        if (v != son[x]) memcpy(f[y + 1], f[y], sizeof(f[y + 1])), upd(f[y + 1], a[v], b[v]), dfs2(v, y + 1);
    }
    if (son[x]) {
        upd(f[y], a[son[x]], b[son[x]]), dfs2(son[x], y);
    }
}

signed main() {
    int n, tot = 0; scanf("%d", &n);
    stack<int> stk;
    for (int i = 1; i <= n; ++i) {
        string S; cin >> S;
        if (S == "ADD") {
            int t = (stk.empty() ? 0 : stk.top());
            G[t].push_back(++tot), stk.push(tot);
            scanf("%d%d", &a[tot], &b[tot]);
        } else {
            stk.pop();
        }
        id[i] = (stk.empty() ? 0 : stk.top());
    }
    dfs1(0), memset(f[0], 0x3f, sizeof(f[0])), f[0][0] = 0, dfs2(0);
    for (int i = 1; i <= n; ++i) printf("%d\n", res[id[i]]);
    return 0;
}