#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ls k<<1
#define rs k<<1|1
#define lson ls,l,mid
#define rson rs,mid+1,r
const int N=1e5+5,mod=1e9+7;
const ll inf=1e17,inv2=5e8+4;
int n,ans;
vector<pair<ll,int> > v[N<<2];
map<ll,pair<int,int> > mp;
map<ll,pair<int,int> >::iterator koishi;
void updt(int k,int l,int r,int pl,int pr,ll pos,int val) {
    if(!val) return;
    if(pl<=l&&r<=pr) {
        v[k].push_back(make_pair(pos,val));
        return;
    }
    int mid=(l+r)>>1;
    if(mid>=pl) updt(lson,pl,pr,pos,val);
    if(mid<pr) updt(rson,pl,pr,pos,val);
    return;
}
int top;
vector<pair<ll,ll> > stadd[N],stdel[N];
int lstans[N];
set<pair<ll,ll> > st;
set<pair<ll,ll> >::iterator it;

int calc(ll x,ll y) {
    x%=mod,y%=mod;
    return 1ll*(x+y)*(y-x+1)%mod*inv2%mod;
}
void add(ll pos,int val) {
    top++;
    stadd[top].clear();
    stdel[top].clear();
    while(true) {
        if(!val) break;
        it=st.lower_bound(make_pair(pos,0));
        if(it==st.end()) {
            st.insert(make_pair(pos+val-1,pos));
            stadd[top].push_back(make_pair(pos+val-1,pos));

            ans+=calc(pos,pos+val-1);
            if(ans>=mod) ans-=mod;
            break;
        }
        ll r=(*it).first,l=(*it).second;
        if(l>pos) {
            ll t=min(l-pos,val*1ll);
            if(t==l-pos) {
                val-=t;
                st.erase(make_pair(r,l));
                stdel[top].push_back(make_pair(r,l));
                ans-=calc(l,r);
                if(ans<0) ans+=mod;

                st.insert(make_pair(r,pos));
                stadd[top].push_back(make_pair(r,pos));

                ans+=calc(pos,r);
                if(ans>=mod) ans-=mod;
                pos=r;
                continue;
            }
            st.insert(make_pair(pos+val-1,pos));
            stadd[top].push_back(make_pair(pos+val-1,pos));

            ans+=calc(pos,pos+val-1);
            if(ans>=mod) ans-=mod;
            break;
        }
        it++;
        ll l2=inf,r2=inf;
        if(it!=st.end()) l2=(*it).second,r2=(*it).first;

        st.erase(make_pair(r,l));
        stdel[top].push_back(make_pair(r,l));

        ans-=(l+r)*(r-l+1)%mod*inv2%mod;
        if(ans<0) ans+=mod;

        ll t=min(l2-r-1,val*1ll);
        if(t==l2-r-1) {
            val-=t;
            st.erase(make_pair(r2,l2));
            stdel[top].push_back(make_pair(r2,l2));
            ans-=(l2+r2)*(r2-l2+1)%mod*inv2%mod;
            if(ans<0) ans+=mod;

            st.insert(make_pair(r2,l));
            stadd[top].push_back(make_pair(r2,l));

            ans+=(l+r2)*(r2-l+1)%mod*inv2%mod;
            if(ans>=mod) ans-=mod;
            pos=r2;
            continue;
        }
        st.insert(make_pair(r+val,l));
        stadd[top].push_back(make_pair(r+val,l));

        ans+=(l+r+val)*(r+val-l+1)%mod*inv2%mod;
        if(ans>=mod) ans-=mod;
        break;
    }
    lstans[top]=ans;
    return;
}
void del(int koishi) {
    while(top>koishi) {
        for(int i=0;i<stdel[top].size();i++) {
            st.insert(make_pair(stdel[top][i].first,stdel[top][i].second));
        }
        for(int i=0;i<stadd[top].size();i++) {
            st.erase(make_pair(stadd[top][i].first,stadd[top][i].second));
        }
        top--;
        ans=lstans[top];
    }
    return;
}
void qury(int k,int l,int r) {
    int _=top;
    for(int i=0;i<v[k].size();i++) add(v[k][i].first,v[k][i].second);
    if(l==r) {
        printf("%d\n",ans);
        del(_);
        return;
    }
    int mid=(l+r)>>1;
    qury(lson);
    qury(rson);
    del(_);
    return;
}
int main() {
    scanf("%d",&n);
    for(int i=1;i<=n;i++) {
        ll x;
        int y;
        scanf("%lld%d",&x,&y);
        if(mp.count(x)!=0) updt(1,1,n,mp[x].first,i-1,x,mp[x].second);
        mp[x]=make_pair(i,y);
    }
    for(koishi=mp.begin();koishi!=mp.end();koishi++) {
        int x=(*koishi).second.first,y=(*koishi).second.second;
        updt(1,1,n,x,n,(*koishi).first,y);
    }
    qury(1,1,n);
    return 0;
}