// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 50005, M = 150005, B = 14;

int q, n, ty[N], id[3], ps[N], tot, p1[N], p2[N], Lg[1 << B], O = 10000;

char op[5];

struct E{
	int x, y, z, a, b;
} e[N];

bool st[N];

struct Node{
	LL s, mn;
};

struct W{
	int C[3];
	Node W;
};

Node inline operator + (const Node &a, const Node &b) {
	return (Node) { a.s + b.s, min(a.mn, a.s + b.mn) };
}


struct Tas{
	int OP[M], D[M][3], ID[M];
	W a[N];
	int n, m, p[N], ar[3][N], idt;
	Node ans[N];
	vector<PII> tr[N];
	void inline insS(int x) {
		tr[(x - 1) / B + 1].pb(mp(m + 1, x));
	}
	void inline insQ(int id, int x, int y, int z) {
		++m;
		ID[m] = id;
		D[m][0] = x, D[m][1] = y, D[m][2] = z;
	}
	void inline insE(int x, int y, int z, Node o) {
		++n;
		a[n].C[0] = x;
		a[n].C[1] = y;
		a[n].C[2] = z;
		a[n].W = o;
	}
	Node val[1 << B];
	int st[M], z[3][N];
	int o;
	bool ct(int x, int y) {
		return a[x].C[o] < a[y].C[o];
	}
	int b;
	void inline work(int l, int r) {
		int t = r - l + 1;
		for (int i = 1; i < (1 << t); i++) {
			val[i] = a[l + Lg[i & -i]].W + val[i ^ (i & -i)];
		}
		int now = 0;
		for (int i = 1; i <= m; i++) st[i] = (1 << t) - 1;
		for (int i = l; i <= r; i++) p[i] = i;
		for (int t = 0; t < 3; t++) {
			o = t;
			sort(p + l, p + 1 + r, [&](int x,int y){return a[x].C[o] < a[y].C[o];});
			now = 0;
			for (int i = 1; i < a[p[l]].C[t]; i++)
				z[t][i] = 0;
			for (int i = l; i <= r; i++) {
				now ^= 1 << (p[i] - l);
				int rt = i == r ? O : a[p[i + 1]].C[t] - 1;
				for (int j = a[p[i]].C[t]; j <= rt; j++)
					z[t][j] = now;
			}
		}
		now = 0;
		int len = tr[b].size();
		for (int i = 0; i < len; i++) {
			now ^= 1 << (tr[b][i].se - l);
			if (i == len - 1 || tr[b][i].fi != tr[b][i + 1].fi) {
				int r = i == len - 1 ? m : tr[b][i + 1].fi - 1;
				for (int j = tr[b][i].fi; j <= r; j++) {
					ans[j] = ans[j] + val[now & z[0][D[j][0]] & z[1][D[j][1]] & z[2][D[j][2]]];
				}
			}
		}
	}
	void inline work() {
		for (int i = 1; i <= n; i += B) {
			int r = min(n, i + B - 1);
			++b;
			work(i, r);
		}
	}
} t1, t2;

bool inline cmp1(int x, int y) {
	return e[x].a < e[y].a;
}

bool inline cmp2(int x, int y) {
	return e[x].b > e[y].b;
}

int G[M], L[M], D[M], OP[M];

int main() {
	for (int i = 0; i < B; i++) Lg[1 << i] = i;
	read(q);
	for (int i = 1; i <= q; i++) {
		scanf("%s", op);
		if (op[0] == '+') {
			int x, y, z, a, b;
			read(x), read(y), read(z), read(a), read(b);
			e[++n] = (E) { x, y, z, a, b };
			G[i] = n;
		} else if (op[0] == '-') {
			int k; read(k);
			G[i] = k;
		} else {
			OP[i] = 1;
			int g, l, d; read(g), read(l), read(d);
			G[i] = g, L[i] = l, D[i] = d;
		}
	}
	for (int i = 1; i <= n; i++) p1[i] = p2[i] = i;
	sort(p1 + 1, p1 + 1 + n, cmp1);
	sort(p2 + 1, p2 + 1 + n, cmp2);
	for (int i = 1; i <= n; i++) {
		int u = p1[i];
		if (e[u].a <= e[u].b) {
			ps[u] = ++id[1];
			t1.insE(e[u].x, e[u].y, e[u].z, (Node){ -e[u].a + e[u].b, -e[u].a});
			ty[u] = 1;
		}
	}
	for (int i = 1; i <= n; i++) {
		int u = p2[i];
		if (e[u].a > e[u].b) {
			ps[u] = ++id[2];
			t2.insE(e[u].x, e[u].y, e[u].z, (Node){ -e[u].a + e[u].b, -e[u].a});
			ty[u] = 2;
		}
	}
	for (int i = 1; i <= q; i++) {
		if (!OP[i]) {
			if (ty[G[i]] == 1) t1.insS(ps[G[i]]);
			else t2.insS(ps[G[i]]);
		} else {
			int g = G[i], l = L[i], d = D[i];
			++tot;
			t1.insQ(tot, g, l, d);
			t2.insQ(tot, g, l, d);
		}
	}
	t1.work(), t2.work();
	for (int i = 1; i <= tot; i++) {
		Node u = t1.ans[i] + t2.ans[i];
		printf("%lld\n", -u.mn);
	}
    return 0;
}