#include<bits/stdc++.h>

namespace IO
{
	template<typename Type>
	void read(Type &x){
		char ch=getchar();
		x=0;bool f=0;
		while(ch<'0'||ch>'9')
			f|=(ch=='-'),ch=getchar();
		while(ch>='0'&&ch<='9')
			x=((x<<1)+(x<<3)+(ch^48)),ch=getchar();
		x=f?-x:x;
	}
}

using namespace std;

int opt,d,a,b,T;

struct node
{
	int A,B;
	bool operator < (const node &a) const
	{
		return max(A,B)<max(a.A,a.B);
	}
};

multiset<node> L,C;

void solve()
{
	IO::read(opt);IO::read(d);IO::read(a);IO::read(b);
	if(opt){
		if(!d) L.insert({a,b});
		else C.insert({a,b});
	}else{
		if(!d&&L.count({a,b})) L.erase({a,b});
		else if(C.count({a,b})) C.erase({a,b});
	}
	if(L.empty()||C.empty()){puts("-1");return;}
	auto cur1=*L.begin(),cur2=*C.begin();
	int ax=cur1.A,bx=cur1.B,ay=cur2.A,by=cur2.B;
	printf("%lld\n",max(1ll*ax+1ll*ay,1ll*bx+1ll*by));
}

int main()
{
	IO::read(T);
	while(T--)
		solve();
}