#include<bits/stdc++.h>
#define int long long
#define ll long long
#define int128 __int128
#define INF ((int)1e18 + 2)
#define N ((int)1e5 + 2)
#define mod ((int)1e9 + 7)
#define base 23333
#define base2 19260817
#define db double
#define ldb long double
#define eps 1e-8
#define lowbit(x) (x & -x) 
#define un unsigned
#define rep(i,x,y) for (int i = (x); i <= (y); ++i)
#define drep(i,x,y) for (int i = (x); i >= (y); --i)
#define go(i,u) for (int i = head[u]; i; i = edge[i].next)
#define go_(i,u) for (int i = head[u]; ~i; i = edge[i].next)
#define pii pair<int, int>
#define MP make_pair
#define fir first
#define sec second
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
using namespace std;
//char buf[1<<21],*p1=buf,*p2=buf;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T> inline T rnd(T l,T r) {return uniform_int_distribution<T>(l , r)(rng);}
template<typename T> inline void read (T &t) {
	t = 0; char f = 0, ch = getchar(); long db d = 0.1;
	while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
	while (ch <= '9' && ch >= '0') t = t * 10 + ch - 48, ch = getchar();
	if (ch == '.') {
		ch = getchar();
		while (ch <= '9' && ch >= '0') t += d * (ch ^ 48), d *= 0.1, ch = getchar();
	}
	t = (f ? -t : t);
}
template <typename T, typename... Args>
	inline void read (T& t, Args&... args) { read(t); read(args...); }
inline void write (int x) {
	if (x >= 10) write(x / 10);
	cout << (ll)(x % 10);
}
int n, inv2;
const int lim = 2e14;
inline int ksm (int a, int b) {
	int ret = 1;
	while (b) {
		if (b & 1) ret = ret * a % mod;
		a = a * a % mod, b >>= 1;
	}
	return ret;
}
inline int get_sum (int l, int r) {
	return (l + r) % mod * ((r - l + 1) % mod) % mod * inv2 % mod; }
struct Seg_tree {
	int cnt, root, ls[N * 120], rs[N * 120], Size[N * 120], sum[N * 120], mark[N * 120];
	inline void pushup (int rt) {
		Size[rt] = Size[ls[rt]] + Size[rs[rt]];
		sum[rt] = (sum[ls[rt]] + sum[rs[rt]]) % mod;
	}
	inline int insert (int rt, int l, int r, int ql, int qr) {
		//cout<<6<<" "<<rt<<" "<<l<<" "<<r<<" "<<ql<<" "<<qr<<'\n';
		//cout<<ql<<" "<<qr<<'\n';
		int new_ = ++cnt;
		ls[new_] = ls[rt], rs[new_] = rs[rt], Size[new_] = Size[rt];
		sum[new_] = sum[rt], mark[new_] = mark[rt];
		if (ql > qr || mark[new_]) return new_;
		if (ql <= l && r <= qr) {
			Size[new_] = r - l + 1, sum[new_] = get_sum(l, r), mark[new_] = 1;
			return new_;
		}
		int mid = (l + r) >> 1;
		if (ql <= mid) ls[new_] = insert(ls[new_], l, mid, ql, qr);
		if (qr > mid) rs[new_] = insert(rs[new_], mid + 1, r, ql, qr);
		pushup(new_);
		return new_;
	}
	inline int query (int rt, int l, int r, int ql, int qr) {
		//cout<<ql<<" "<<qr<<'\n';
		if (ql > qr || l > qr || r < ql || mark[rt]) return 0;
		if (!rt) return min(r, qr) - max(l, ql) + 1;
		if (ql <= l && r <= qr) return r - l + 1 - Size[rt];
		int mid = (l + r) >> 1;
		return query(ls[rt], l, mid, ql, qr) + query(rs[rt], mid + 1, r, ql, qr);
	}
	inline int search (int rt, int l, int r, int p) {
		//cout<<rt<<" "<<l<<" "<<r<<" "<<p<<'\n';
		if (!rt) return l + p - 1;
		int mid = (l + r) >> 1, ret = mid - l + 1 - Size[ls[rt]];
		if (ret >= p) return search(ls[rt], l, mid, p);
		else return search(rs[rt], mid + 1, r, p - ret);
	}
}seg_tree;
vector<pii > vec[N << 2];
inline void change (int rt, int l, int r, int ql, int qr, pii v) {
	/*cout<<ql<<" "<<qr<<'\n';
	cout<<v.fir<<" "<<v.sec<<'\n';*/
	if (ql <= l && r <= qr) return vec[rt].emplace_back(v), void();
	int mid = (l + r) >> 1;
	if (ql <= mid) change(rt << 1, l, mid, ql, qr, v);
	if (qr > mid) change(rt << 1 | 1, mid + 1, r, ql, qr, v);
}
inline void solve (int rt, int l, int r) {
	int cnt = seg_tree.cnt, root = seg_tree.root;
	for (auto x : vec[rt]) /*cout<<rt<<" "<<x.fir<<" "<<x.sec<<'\n', */seg_tree.root = seg_tree.insert(seg_tree.root, 1, lim, x.fir, seg_tree.search(seg_tree.root, 1, lim, seg_tree.query(seg_tree.root, 1, lim, 1, x.fir - 1) + x.sec));
	int mid = (l + r) >> 1;
	if (l == r) printf("%lld\n", seg_tree.sum[seg_tree.root]);
	else solve(rt << 1, l, mid), solve(rt << 1 | 1, mid + 1, r);
	rep (i, cnt + 1, seg_tree.cnt)
		seg_tree.ls[i] = seg_tree.rs[i] = seg_tree.Size[i] = seg_tree.sum[i] = seg_tree.mark[i] = 0;
	seg_tree.cnt = cnt, seg_tree.root = root;
}
map<int, pii > mp;
signed main () {
	read(n);
	inv2 = ksm(2, mod - 2);
	int x, y;
	rep (i, 1, n) {
		read(x, y);
		if(mp.count(x)) change(1, 1, n, mp[x].sec, i - 1, MP(x, mp[x].fir));
		mp[x] = MP(y, i);
	}
	for(auto x : mp) change(1, 1, n, x.sec.sec, n, MP(x.fir, x.sec.fir));
	solve(1, 1, n);
return 0;
}