#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e5+10;
const int N=1e15,mod=1e9+7,inv2=(mod+1)/2;
struct node
{int ls,rs,cnt,val,tag;node(){ls=rs=cnt=val=tag=0;}};
struct segtree{
	node tr[maxn*130];
	int tot;
	inline void pushtg(int i,int l,int r)
	{
		tr[i].tag=1;
		tr[i].cnt=r-l+1;
		tr[i].val=1ll*(r+l)%mod*((r-l+1)%mod)%mod*inv2%mod;
	}
	inline void pushup(int i,int l,int r)
	{
		if(tr[i].tag){return;}
		tr[i].cnt=(tr[tr[i].ls].cnt+tr[tr[i].rs].cnt);
		tr[i].val=(tr[tr[i].ls].val+tr[tr[i].rs].val)%mod;
		return;
	}
	void update(int &i,int p,int l,int r,int L,int R)
	{
		tr[i=++tot]=tr[p];
		assert(tot<=1e7);
		if(L<=l&&r<=R)
		{
			pushtg(i,l,r);
			return;
		}	
		int mid=l+r>>1;
		if(L<=mid)update(tr[i].ls,tr[i].ls,l,mid,L,R);
		if(R>mid)update(tr[i].rs,tr[i].rs,mid+1,r,L,R);
		pushup(i,l,r);
	//	printf("%lld %lld %lld %lld\n",l,r,tr[i].val,tr[i].cnt);
	}
	int query(int i,int l,int r,int L,int R,bool on)
	{
		if(!i)return on?(min(R,r)-max(L,l)+1):0;
		on|=tr[i].tag;
		if(L<=l&&r<=R)
			return on?(r-l+1):tr[i].cnt;
		int mid=l+r>>1;
		if(R<=mid)return query(tr[i].ls,l,mid,L,R,on);
		if(L>mid)return query(tr[i].rs,mid+1,r,L,R,on);
		return query(tr[i].ls,l,mid,L,R,on)+query(tr[i].rs,mid+1,r,L,R,on);
	}
	int find(int i,int l,int r,int R,bool on)
	{
		if(!i)return l+R-1;
		if(l==r)return l;
		int mid=l+r>>1;
		on|=tr[i].tag;
		int suml=on?0:(mid-l+1-tr[tr[i].ls].cnt);
	//	printf("%lld %lld %lld\n",l,r,suml);
		if(suml>R)return find(tr[i].ls,l,mid,R,on);
		else return find(tr[i].rs,mid+1,r,R-suml,on); 
	}
}T;
vector< pair<int,int> > O[maxn<<2]; 
void addoption(int i,int l,int r,int L,int R,int d,int b)
{
	if(L<=l&&r<=R)
	{
		O[i].push_back({d,b});
		return; 
	} 
	int mid=l+r>>1;
	if(L<=mid)addoption(i<<1,l,mid,L,R,d,b);
	if(R>mid)addoption(i<<1|1,mid+1,r,L,R,d,b);
	return;
}
int RT[maxn<<2];
inline void add(int d,int b,int &rt)
{
	int x=T.query(rt,1,N,1,d-1,0);
//	printf("%lld\n",x);
	int to=T.find(rt,1,N,d+b-x-1,0);
//	printf("!%lld %lld\n",d,to);
	T.update(rt,rt,1,N,d,to);
}
int ans[maxn];
void dfs(int i,int l,int r)
{
	int m=T.tot;
	RT[i]=RT[i>>1];
	int mid=l+r>>1;
	for(auto p:O[i])
	{
		//printf("%lld %lld %lld %lld\n",l,r,p.first,p.second);
		add(p.first,p.second,RT[i]);
	}
	if(l==r)
		ans[l]=T.tr[RT[i]].val;
	else 
	{
		dfs(i<<1,l,mid);
		dfs(i<<1|1,mid+1,r);
	}
	T.tot=m;
}
int n;
map< int ,pair<int,int> > mp;
signed main()
{
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
	{
		int d,b;
		scanf("%lld%lld",&d,&b);
		if(mp.count(d))
			addoption(1,1,n,mp[d].second,i-1,d,mp[d].first);
		mp[d]={b,i};
	}
	for(auto p:mp)
	{
		int b=p.second.first,i=p.second.second;
		addoption(1,1,n,i,n,p.first,b);
	}
	dfs(1,1,n);
	for(int i=1;i<=n;i++)
		printf("%lld\n",ans[i]);
	return 0;
}