#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+50,M=1e4+50;

struct ask
{
    char opt;int x,y,z,t;
}Q[N],as[N];

int n,q,m=1e4,k,w[N],c[N],mb[N],B=12,x[N],y[N],z[N],dfn[N],p[N],b[N];
ll ans[N],res[N];

struct node
{
    ll mi,now;
};

int px[M],py[M],pz[M],now;
node f[M];vector<int>a;

void init()
{
    n=a.size();now=0;
    for(int i=1;i<=m;i++)px[i]=py[i]=pz[i]=0,f[i]=(node){0,0};
    for(int i=0;i<n;i++)px[x[a[i]]]|=(1<<i),py[y[a[i]]]|=(1<<i),pz[z[a[i]]]|=(1<<i);
    for(int i=1;i<=m;i++)px[i]|=px[i-1],py[i]|=py[i-1],pz[i]|=pz[i-1];
    for(int i=1;i<(1<<n);i++)
    {
        int x=mb[i];f[i]=f[i^(1<<x)];
        x=a[x];f[i].mi=min(f[i].mi,f[i].now-c[x]);f[i].now+=w[x]-c[x];
    }
}

node find(int x,int y,int z)
{
    return f[px[x]&py[y]&pz[z]&now];
}

void ex(int x)
{
    for(int i=0;i<n;i++)if(a[i]==x)
    {
        now^=(1<<i);
        return;
    }
}

struct block
{
    vector<int>a;
    vector<pair<int,int>>ak;
}bl[M*5/12+10];

int cmp(int a,int b)
{
    if((w[a]>=c[a])!=(w[b]>=c[b]))return w[a]>=c[a];
    if(w[a]>=c[a])return c[a]<=c[b];
    return w[a]>=w[b];
}

main()
{
    // freopen("in.txt","r",stdin);
    for(int i=1;i<=(1<<B);i++)for(int j=0;j<B;j++)if((i>>j)&1)mb[i]=j;
    cin>>q;
    for(int i=1;i<=q;i++)
    {
        cin>>Q[i].opt;
        if(Q[i].opt=='+')
        {
            ++n;p[n]=n;Q[i].x=n;
            cin>>x[n]>>y[n]>>z[n]>>c[n]>>w[n];
        }
        if(Q[i].opt=='-')cin>>Q[i].x;
        if(Q[i].opt=='?')cin>>Q[i].x>>Q[i].y>>Q[i].z,as[++k]=Q[i],as[k].t=i;
    }
    sort(p+1,p+1+n,cmp);
    for(int i=1;i<=n;i++)
    {
        dfn[p[i]]=i;b[i]=(i-1)/B+1;
        bl[b[i]].a.push_back(p[i]);
    }
    for(int i=1;i<=q;i++)if(Q[i].opt!='?')bl[b[dfn[Q[i].x]]].ak.push_back(make_pair(i,Q[i].x));
    int mx=b[n];
    for(int i=1;i<=mx;i++)
    {
        swap(a,bl[i].a);init();
        int pos=0;
        for(int j=1;j<=k;j++)
        {
            while(bl[i].ak.size()>pos&&bl[i].ak[pos].first<as[j].t)ex(bl[i].ak[pos++].second);
            node p=find(as[j].x,as[j].y,as[j].z);
            if(res[j]+p.mi<0)ans[j]+=-(res[j]+p.mi),res[j]=-p.mi;
            res[j]+=p.now;
        }
    }
    for(int i=1;i<=k;i++)cout<<ans[i]<<'\n';
}