#include<bits/stdc++.h>
using namespace std;
const long long N=1e5+5,INF=1e9,mod=1e9+7,inv2=(mod+1)/2;
long long n,ans[N];
long long D[N],B[N]; 
map <long long,long long> mp;


struct abc{
	long long d,b;
};
bool operator <(abc X,abc Y){
	if(X.d==Y.d) return X.b<Y.b;
	return X.d<Y.d;
}
vector <abc> Q[N*4];

void modify(long long l,long long r,long long o,long long L,long long R,abc x){
	if(L<=l && r<=R){
		Q[o].push_back(x);
		return ;
	}
	long long mid=(l+r)>>1;
	if(L<=mid) modify(l,mid,o<<1,L,R,x);
	if(R>mid) modify(mid+1,r,o<<1|1,L,R,x);
}


set <abc> S;
long long alc;
void gmod(long long &x){
	x%=mod;
}
long long cal(long long x){
	x%=mod;
	return 1ll*x*(x+1)%mod*inv2%mod; 
}
long long cal(abc x){
	return (cal(x.d+x.b-1)+mod-cal(x.d-1))%mod;
}


struct reco{
	bool typ;
	abc x;
};
stack <reco> rec;
void undo(){
	reco u=rec.top(); rec.pop();
	if(u.typ) S.erase(u.x);
	else S.insert(u.x);
}

void ins(abc x){
	S.insert(x);
	rec.push({1,x});
	gmod(alc+=cal(x));
	
	auto it=S.find(x);
	while(it!=S.begin()){
		auto pre=prev(it);
		abc A=*pre,B=*it; 
		if(A.d+A.b>=B.d){
			abc C=A; C.b+=B.b;
			gmod(alc+=mod-cal(A));
			gmod(alc+=mod-cal(B));
			gmod(alc+=cal(C));
			
			S.erase(A); S.erase(B); S.insert(C);
			rec.push({0,A}); rec.push({0,B}); rec.push({1,C});
			
			it=S.find(C);
		}
		else break;
	}
	
	while(1){
		auto nxt=next(it);
		if(nxt==S.end()) break;
		abc A=*it,B=*nxt; 
		if(A.d+A.b>=B.d){
			abc C=A; C.b+=B.b;
			gmod(alc+=mod-cal(A));
			gmod(alc+=mod-cal(B));
			gmod(alc+=cal(C));
			
			S.erase(A); S.erase(B); S.insert(C);
			rec.push({0,A}); rec.push({0,B}); rec.push({1,C});
			it=S.find(C);
		}
		else break;
	}
	
}



void solve(long long l,long long r,long long o){
//	for(abc x: S) cout<<x.d<<","<<x.b<<" ";
//	cout<<'\n';
	long long sav=rec.size(),ssum=alc;
	
	for(abc u: Q[o]){
		ins(u);
	}
	
	
	if(l==r){
		ans[l]=alc;
	}
	else{
		long long mid=(l+r)>>1;
		solve(l,mid,o<<1);
		solve(mid+1,r,o<<1|1);
	}
	
	while(rec.size()>sav) undo();
	alc=ssum;
	
//	for(abc x: S) cout<<x.d<<","<<x.b<<" ";
//	cout<<'\n';
}

int main(){
//	freopen("1.txt","r",stdin);
//	freopen("2.txt","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin>>n;
	for(long long i=1;i<=n;i++) cin>>D[i]>>B[i];
	
	for(long long i=n;i>=1;i--){
		long long d=D[i],b=B[i];
		
		long long nxt=n;
		if(mp[d]) nxt=mp[d]-1;
		
//		cout<<i<<" "<<nxt<<": "<<d<<" "<<b<<'\n';
		modify(1,n,1,i,nxt,{d,b});
		mp[d]=i;
	}
	
	solve(1,n,1);
	
	for(long long i=1;i<=n;i++) cout<<ans[i]<<'\n';
}