#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 1000000007
#define LC lc[x]
#define RC rc[x]
map<ll,ll> mp;
vector<ll> vec[400040];
ll n,V=2e14,inv2=(mod+1)>>1,d[100010],b[100010];
int lc[21000010],rc[21000010],sum[21000010],rt=0,tot=0,top=0;
ll tree[21000010];
vector<int*> st;
vector<int > sta;
void ins(ll x,ll l,ll r,ll ql,ll qr,ll v){
	if(ql<=l&&r<=qr){
		vec[x].push_back(v);
		return;
	}
	ll mid=(l+r)>>1;
	if(ql<=mid) ins(x<<1,l,mid,ql,qr,v);
	if(mid<qr) ins(x<<1|1,mid+1,r,ql,qr,v);
}
il ll S(ll l,ll r){
	return (l+r)%mod*((r-l+1)%mod)%mod*inv2%mod;
}
il void pushup(ll x){
	tree[x]=tree[LC]+tree[RC];
	sum[x]=(sum[LC]+sum[RC])%mod;
}
void mdf(int &x,ll l,ll r,ll ql,ll qr){
	if(!x){
		if(!sta.empty()){
			x=sta.back();
			sta.pop_back();
		}
		else{
			x=++tot;
//			if(tree[x]||sum[x]) pf("%d %lld %d\n",x,tree[x],sum[x]);
//			assert(!tree[x]&&!sum[x]);
		}
		LC=RC=0;
	}
	if(tree[x]==(r-l+1)) return;
	st.push_back(&x);
	if(ql<=l&&r<=qr){
		tree[x]=r-l+1;
		sum[x]=S(l,r);
		return;
	}
	ll mid=(l+r)>>1;
	if(ql<=mid) mdf(LC,l,mid,ql,qr);
	if(mid<qr) mdf(RC,mid+1,r,ql,qr);
	pushup(x);
}
ll querycnt(ll x,ll l,ll r,ll ql,ll qr){
	if(!x||ql>qr) return 0;
	if(ql<=l&&r<=qr) return tree[x];
	if(tree[x]==(r-l+1)) return min(qr,r)-max(ql,l)+1;
	ll mid=(l+r)>>1,res=0;
	if(ql<=mid) res+=querycnt(LC,l,mid,ql,qr);
	if(mid<qr) res+=querycnt(RC,mid+1,r,ql,qr);
	return res;
}
ll query(ll x,ll l,ll r,ll k){
	if(l==r) return l;
	ll mid=(l+r)>>1;
	if((mid-l+1-tree[LC])>=k) return query(LC,l,mid,k);
	else return query(RC,mid+1,r,k-(mid-l+1-tree[LC]));
}
void recycle(ll tmp){
	while((ll)st.size()>tmp){
		int &x=*st.back();
		pushup(x);
		if(!tree[x]){
			sta.push_back(x);
			x=0;
		}
		st.pop_back();
	}
}
void solve(ll x,ll l,ll r){
	ll tmp=st.size();
	fr(i,0,(ll)vec[x].size()-1){
		ll id=vec[x][i],cnt=d[id]-1-querycnt(rt,1,V,1,d[id]-1);
		ll pos=query(rt,1,V,cnt+b[id]);
		mdf(rt,1,V,d[id],pos);
	}
	if(l==r) /*writeln(sum[rt])*/;
	else{
		ll mid=(l+r)>>1;
		solve(x<<1,l,mid);
		solve(x<<1|1,mid+1,r);
	}
	recycle(tmp);
}
int main(){
	n=read();
	fr(i,1,n){
		d[i]=read();
		b[i]=read();
		if(mp.count(d[i])){
			ll tmp=mp[d[i]];
			ins(1,1,n,tmp,i-1,tmp);
		}
		mp[d[i]]=i;
	}
	for(map<ll,ll>::iterator it=mp.begin();it!=mp.end();it++){
		ll tmp=(*it).sec;
		ins(1,1,n,tmp,n,tmp);
	}
	solve(1,1,n);
}