#include<bits/stdc++.h>
using namespace std;

#define mkp(x,y) make_pair(x,y)
#define pii pair<int,int>
#define lch (w<<1)
#define rch (w<<1|1)

const int N = (250020);
const int KEY = N * 2;
const int INF = N * 2;  //

int n;
multiset<pii> multibar[2][KEY];
struct rec{
   int ux, uy, vx, vy;
   int ans;
}tr[KEY<<2];

void update(int w, int l, int r, int key) {
   if (l == r) {
      if(!multibar[0][key].empty()){
        tr[w].ux = multibar[0][key].begin()->first;
        tr[w].uy = multibar[0][key].begin()->second; //
      }
      else tr[w].ux = tr[w].uy = INF;  //
      if(!multibar[1][key].empty()){
        tr[w].vx = multibar[1][key].begin()->first;
        tr[w].vy = multibar[1][key].begin()->second;
      }
      else tr[w].vx = tr[w].vy = INF;
      tr[w].ans = min(tr[w].vx+tr[w].ux, tr[w].uy+tr[w].vy); //
      tr[w].ans = min(tr[w].ans, INF);
      return;
   }
   int mid = (l + r)/2;
   if (key > mid) update(rch, mid+1, r, key);
     else update(lch, l, mid, key);
   tr[w].ux = min(tr[lch].ux, tr[rch].ux);  
   tr[w].uy = min(tr[lch].uy, tr[rch].uy);  
   tr[w].vx = min(tr[lch].vx, tr[rch].vx);  
   tr[w].vy = min(tr[lch].vy, tr[rch].vy);  
   tr[w].ans = min(tr[lch].ans, tr[rch].ans);
   tr[w].ans = min(tr[w].ans, min(tr[lch].vx + tr[rch].ux, tr[lch].uy + tr[rch].vy));
   return;
}

void build(int w, int l, int r){
   tr[w].ux = tr[w].uy = tr[w].vx = tr[w].vy = tr[w].ans = INF; 
   if (l == r) return;
   int mid = (l+r)/2;
   build(lch,l,mid);
   build(rch,mid+1,r);
   return;
}

inline int rd()
{
    int sign = 1, re = 0; char c = getchar();
    while(!isdigit(c)){if(c == '-') sign = -1; c = getchar();}
    while(isdigit(c)){re = re * 10 + (c - '0'); c = getchar();}
    return sign * re;
}

int main(){
    n = rd();
    build(1,0,KEY-1);
    for (int i = 1;i <= (n);++ i)
    {
        int ty = rd(), st = rd(), x = rd(), y = rd(); -- st; //
        int key = (st == 0)?x-y:y-x; key += N;
        if (ty == 1) multibar[st][key].insert(mkp(x,y));
          else multibar[st][key].erase(multibar[st][key].find(mkp(x,y)));
        update(1,0,KEY-1,key);
        printf("%d\n",(tr[1].ans == INF)?-1:tr[1].ans); //
    }
    return 0;
}