#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>using namespace std;int n;struct X{	int x,y;	int ll,rr;	int id;}s[100010];int L[100010], R[100010], ans[100010];bool cmp(X a,X b){	return a.x<b.x;}int mn[2][4*100010];int mx[2][4*100010];int B;void update(int op,int pos,int val,int l,int r,int rt){	if(l==r)	{		mn[op][rt] = mx[op][rt] = val;		return ;	}	int mid = ( l + r) / 2;	if(pos<=mid) update(op,pos,val,l,mid,2*rt);	else update(op,pos,val,mid+1,r,2*rt+1);		mn[op][rt] = min(mn[op][2*rt], mn[op][2*rt+1]);	mx[op][rt] = max(mx[op][2*rt], mx[op][2*rt+1]);}void MIN(int op,int L,int R,int l,int r,int rt){	if(L<=l&&r<=R)	{		B = min(B,mn[op][rt]);		return ;	}	int mid = ( l + r) / 2;	if(L<=mid) MIN(op,L,R,l,mid,2*rt);	if(R>mid) MIN(op,L,R,mid+1,r,2*rt+1);}void MAX(int op,int L,int R,int l,int r,int rt){	if(L<=l&&r<=R)	{		B = max(B,mx[op][rt]);		return ;	}	int mid = ( l + r) / 2;	if(L<=mid) MAX(op,L,R,l,mid,2*rt);	if(R>mid) MAX(op,L,R,mid+1,r,2*rt+1);}int main(){	scanf("%d",&n);	for(int i=1;i<=n;i++) 	{		scanf("%d%d",&s[i].x,&s[i].y);		s[i].ll = s[i].x - s[i].y;		s[i].rr = s[i].x + s[i].y;		s[i].id = i;	}	sort(s+1,s+1+n,cmp);		for(int i=1;i<=n;i++) 	{		int left = 1, right = i, pos;		while(left <= right)		{			int mid = (left + right)/2;			if(s[mid].x >= s[i].ll) pos = mid, right = mid-1;			else left = mid + 1;		}		L[i] = pos;		left = i, right = n;		while(left<=right)		{			int mid = (left + right)/2;			if(s[mid].x <= s[i].rr) pos = mid, left = mid+1;			else right = mid - 1;		}		R[i] = pos;	}	for(int i=1;i<=n;i++)	{		update(0,i,L[i],1,n,1);		update(1,i,R[i],1,n,1);	}	while(1)	{		bool f = 0;		for(int i=1;i<=n;i++)		{			B = n+1;			MIN(0,L[i],i,1,n,1);			if(B != L[i]) f=1, L[i] = B, update(0,i,L[i],1,n,1);		}		for(int i=n;i>=1;i--)		{			B = 0;			MAX(1,i,R[i],1,n,1);			if(B != R[i]) f=1, R[i] = B, update(1,i,R[i],1,n,1);		}		for(int i=1;i<=n;i++)		{			B = 0;			MAX(1,L[i],i,1,n,1);			if(B != R[i]) f=1, R[i] = B, update(1,i,R[i],1,n,1);		}		for(int i=n;i>=1;i--)		{			B = n+1;			MIN(0,i,R[i],1,n,1);			if(B != L[i]) f=1, L[i] = B, update(0,i,L[i],1,n,1);		}				if( f == 0 ) break;	}	for(int i=1;i<=n;i++) ans[s[i].id] = R[i] - L[i] + 1;	for(int i=1;i<=n;i++)	{		printf("%d",ans[i]);		if(i<n) printf(" ");		else printf("\n");	}	return 0;}