#include<bits/stdc++.h>

#define lson l,mid,rt<<1

#define rson mid+1,r,rt<<1|1

using namespace std;

typedef long long ll;

const int N=2e5+;

struct node{int x,y,l,r;}p[N],q[N];

int n,tim,tot,top;

ll ans[N];

vector<node>a[N<<];

node st[N];

bool cmp(node a,node b){return a.x==b.x?a.y<b.y:a.x<b.x;}

ll dot(node a,node b){return 1ll*a.x*b.x+1ll*a.y*b.y;}

ll cross(node a,node b,node c){return 1ll*(a.x-c.x)*(b.y-c.y)-1ll*(a.y-c.y)*(b.x-c.x);}

void update(int L,int R,int id,int l,int r,int rt)

{

    if(L<=l&&r<=R){a[rt].push_back(p[id]);return;}

    int mid=l+r>>;

    if(L<=mid)update(L,R,id,lson);

    if(R>mid)update(L,R,id,rson);

}

ll query(int id)

{

    int l=,r=top,m1,m2;

    ll ret=;

    while(r-l>=)

    {

        m1=l+(r-l)/,m2=r-(r-l)/;

        if(dot(q[id],st[m1])<=dot(q[id],st[m2]))l=m1;else r=m2;

    }

    for(int i=l;i<=r;i++)ret=max(ret,dot(q[id],st[i]));

    return ret;

}

void work(int x,int l,int r)

{

    if(!a[x].size())return;

    top=;

    sort(a[x].begin(),a[x].end(),cmp);

    for(int i=;i<a[x].size();i++)

    {

        while(top>&&cross(st[top-],st[top],a[x][i])>=)top--;

        st[++top]=a[x][i];

    }

    for(int i=l;i<=r;i++)ans[i]=max(ans[i],query(i));

}

void divide(int l,int r,int rt)

{

    work(rt,l,r);

    if(l==r)return;

    int mid=l+r>>;divide(lson),divide(rson);

}

int main()

{

    scanf("%d",&n);

    for(int i=,op,x,y;i<=n;i++)

    {

        scanf("%d%d",&op,&x);

        if(op==)scanf("%d",&y),p[++tot]=(node){x,y,tim+,-};

        else if(op==)p[x].r=tim;

        else scanf("%d",&y),q[++tim]=(node){x,y,tim,tim};

    }

    for(int i=;i<=tot;i++)if(p[i].r==-)p[i].r=tim;

    for(int i=;i<=tot;i++)if(p[i].l<=p[i].r)update(p[i].l,p[i].r,i,,tim,);

    divide(,tim,);

    for(int i=;i<=tim;i++)printf("%lld\n",ans[i]);

}