//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n;
int x[400400],y[400400];
int L=1;
map<pii,int> Mp;
int Manhattan(int a,int b)
{
	return abs(x[a]-x[b])+abs(y[a]-y[b]);
}
int Chebyshev(int a,int b)
{
	return max(abs(x[a]-x[b]),abs(y[a]-y[b]));
}
struct solver
{
	int ind;
	vector<int> cand1,cand2;
	map<int,int> Mp;
	int mx,mn;
	int Answer;
	solver(){}
	solver(int _ind,int _cur)
	{
		Answer=0;
		mx=0;
		mn=inf;
		for(int i=1;i<=_cur;i++) if(i!=_ind)
		{
			mx=max(mx,Manhattan(_ind,i));
			mn=min(mn,Chebyshev(_ind,i));
		}
		for(int i=1;i<=_cur;i++) if(i!=_ind)
			if(Manhattan(_ind,i)==mx)
				cand1.pb(i);
		for(int i=1;i<=_cur;i++) if(i!=_ind)
			if(Chebyshev(_ind,i)==mn)
				cand2.pb(i);
		for(auto x:cand1) Mp[x]++;
		for(auto x:cand2) Mp[x]++;
		for(auto pr:Mp) Answer+=(pr.second==2);
		ind=_ind;
	}
	void add(int _ind)
	{
		if(Manhattan(_ind,ind)>mx)
		{
			mx=Manhattan(_ind,ind);
			for(auto x:cand1)
			{
				if(Mp[x]==2) Answer--;
				Mp[x]--;
			}
			cand1.clear();
			Mp[_ind]++;
			cand1.pb(_ind);
		}
		else if(Manhattan(_ind,ind)==mx)
		{
			Mp[_ind]++;
			cand1.pb(_ind);
		}
		if(Chebyshev(_ind,ind)<mn)
		{
			mn=Chebyshev(_ind,ind);
			for(auto x:cand2)
			{
				if(Mp[x]==2) Answer--;
				Mp[x]--;
			}
			cand2.clear();
			Mp[_ind]++;
			if(Mp[_ind]==2) Answer++;
			cand2.pb(_ind);
		}
		else if(Chebyshev(_ind,ind)==mn)
		{
			Mp[_ind]++;
			if(Mp[_ind]==2) Answer++;
			cand2.pb(_ind);
		}
	}
	~solver()
	{
		vector<int>().swap(cand1);
		vector<int>().swap(cand2);
		map<int,int>().swap(Mp);
	}
};
vector<solver> vsv;
vector<int> vind;
int val[2][2];
void rebuild(int ind)
{
	vsv.clear();
	vind.clear();
	Mp.clear();
	for(int i=1;i<=ind;i++)
	{
		int x2=x[i]/L;
		int y2=y[i]/L;
		int val=Mp[pii(x2,y2)];
		if(!val) Mp[pii(x2,y2)]=i;
		else Mp[pii(x2,y2)]=-1;
	}
	for(auto pr:Mp)
		if(~pr.second)
		{
			vind.pb(pr.second);
			vsv.pb(pr.second,ind);
		}
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=0;i<2;i++)
		for(int j=0;j<2;j++)
			val[i][j]=-inf;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>x[i]>>y[i];
		int x2=x[i]/L;
		int y2=y[i]/L;
		for(auto &x:vsv) x.add(i);
		if(Mp.find(pii(x2,y2))==Mp.end())
		{
			Mp[pii(x2,y2)]=i;
			vsv.pb(i,i);
			vind.pb(i);
		}
		else if(~Mp[pii(x2,y2)])
		{
			int p=find(ALL(vind),Mp[pii(x2,y2)])-vind.begin();
			vind.erase(vind.begin()+p);
			vsv.erase(vsv.begin()+p);
			Mp[pii(x2,y2)]=-1;
		}
		for(int a=0;a<2;a++)
			for(int b=0;b<2;b++)
				val[a][b]=max(val[a][b],(a?x[i]:-x[i])+(b?y[i]:-y[i]));
		int mx=0;
		for(int a=0;a<2;a++)
			for(int b=0;b<2;b++)
				mx=max(mx,val[a^1][b^1]+(a?x[i]:-x[i])+(b?y[i]:-y[i]));
		if(mx>=L*8)
		{
			L*=2;
			rebuild(i);
		}
		int Total=0;
		for(auto &x:vsv) Total+=x.Answer;
		cout<<Total<<'\n';
	}
	return 0;
}