#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;
}Q[N];

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

struct node
{
    ll mi,now;
};

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

    void init()
    {
        n=a.size();
        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;
        }
    }
}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;
    }
    sort(p+1,p+1+n,cmp);
    return 0;
    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<=b[n];i++)bl[i].init();
    for(int i=1;i<=q;i++)
    {
        if(Q[i].opt!='?')
        {
            bl[b[dfn[Q[i].x]]].ex(Q[i].x);
            continue;
        }
        ll ans=0,now=0;
        for(int j=1;j<=b[n];j++)
        {
            node p=bl[j].find(Q[i].x,Q[i].y,Q[i].z);
            if(now+p.mi<0)ans+=-(now+p.mi),now=-p.mi;
            now+=p.now;
        }
        cout<<ans<<'\n';
    }
    // cout<<bl[1].n<<' '<<bl[1].now<<'\n';
}