#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 150000
#define M 10000
#define K 10
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int sgn(int x)
{
    if (x>0) return 1;
    else if (x==0) return 0;
    else return -1;
}
struct reads
{
    int x,y,z,a,b,num,snum,snum2;
    bool operator < (const reads &t)const
    {
	if (sgn(a)!=sgn(t.a)) return sgn(a)>sgn(t.a);
	else if (sgn(a)==1) return a-b<t.a-t.b;
	else return b>t.b;
    }
};
reads st[N+1];
bool cmp(reads a,reads b)
{
    return a.x<b.x;
}
bool cmp2(reads a,reads b)
{
    return a.y<b.y;
}
bool cmp3(reads a,reads b)
{
    return a.z<b.z;
}
bool cmp4(reads a,reads b)
{
    return a.num<b.num;
}
struct node
{
    long long a,b;
};
node dp[1<<K],ans[N+1];
node operator + (node x,node y)
{
    return (node){x.a+y.a,max(x.b+y.a,y.b)};
}
int Base=10,q,length,A[M+1],B[M+1],C[M+1],ps[N+1],X[N+1],Y[N+1],Z[N+1];
char c[N+1];
int main()
{
    int d,rst,res;
    q=read();
    for (int i=1;i<=q;++i)
    {
	cin>>c[i];
	if (c[i]=='+') ++length,st[length]=(reads){read(),read(),read(),read(),read(),0,i},swap(st[length].a,st[length].b),st[length].a=st[length].b-st[length].a;
	else if (c[i]=='-')  st[read()].snum2=i;
	else X[i]=read(),Y[i]=read(),Z[i]=read();
    }
    sort(st+1,st+length+1);
    for (int i=1;i<=length;++i) st[i].num=i,ps[st[i].snum]=ps[st[i].snum2]=i;
    sort(st+1,st+length+1,cmp);
    for (int i=1;i<=q;++i) X[i]=lower_bound(st+1,st+length+1,(reads){X[i]+1,0,0},cmp)-st-1;
    for (int i=1;i<=length;++i) st[i].x=i;
    sort(st+1,st+length+1,cmp2);
    for (int i=1;i<=q;++i) Y[i]=lower_bound(st+1,st+length+1,(reads){0,Y[i]+1,0},cmp2)-st-1;
    for (int i=1;i<=length;++i) st[i].y=i;
    sort(st+1,st+length+1,cmp3);
    for (int i=1;i<=q;++i) Z[i]=lower_bound(st+1,st+length+1,(reads){0,0,Z[i]+1},cmp3)-st-1;
    for (int i=1;i<=length;++i) st[i].z=i;
    sort(st+1,st+length+1,cmp4);
    for (int i=1;i<=length;i+=Base)
    {
	d=min(i+Base-1,length)-i+1;
	for (int j=0;j<(1<<d);++j)
	{
	    dp[j]=(node){0,0};
	    for (int k=1;k<=d;++k)
		if (j&(1<<(k-1)))
		    dp[j]=dp[j]+(node){st[i+k-1].a,st[i+k-1].b};
	}
	rst=0;
	for (int j=1;j<=M;++j) A[j]=B[j]=C[j]=0;
	for (int j=i;j<=min(i+Base-1,length);++j) A[st[j].x]|=(1<<(j-i)),B[st[j].y]|=(1<<(j-i)),C[st[j].z]|=(1<<(j-i));
	for (int j=2;j<=M;++j) A[j]|=A[j-1],B[j]|=B[j-1],C[j]|=C[j-1];
	for (int j=1;j<=q;++j)
	{
	    if (c[j]!='?'&&i<=ps[j]&&ps[j]<=min(i+Base-1,length)) rst^=(1<<(ps[j]-i));
	    else res=A[X[j]]&B[Y[j]]&C[Z[j]]&rst,ans[j]=ans[j]+dp[res];
	}
    }
    for (int i=1;i<=q;++i)
	if (c[i]=='?')
	    printf("%lld\n",max(ans[i].a,ans[i].b));
    return 0;
}