#include <bits/stdc++.h>

using namespace std;

#define int long long
using pii = pair<int, int>;
#define vv vector
#define fi first
#define se second
#define eb emplace_back

const int N = 1e5 + 10;
const int M = 2e14;
const int mod = 1e9 + 7;
const int inv2 = (mod + 1) / 2;
int add(int a, int b) {return (a + b >= mod) ? (a + b - mod) : (a + b);}
int S(int l, int r) {return ((l + r) % mod) * ((r - l + 1) % mod) % mod * inv2 % mod;};

int n;
map<int, pii> mp;
vv<pii> tr[N];

namespace seg {
	int rt, cnt;
	int lc[N * 150], rc[N * 150], siz[N * 150], sum[N * 150];
	bool tag[N * 150];

	#define mid ((l + r) >> 1)
	void pushup(int p) {
		siz[p] = siz[lc[p]] + siz[rc[p]];
		sum[p] = add(sum[lc[p]], sum[rc[p]]);
	}

	int update(int q, int l, int r, int L, int R) {
		int p = ++cnt;
		lc[p] = lc[q]; rc[p] = rc[q]; siz[p] = siz[q]; sum[p] = sum[q]; tag[p] = tag[q];
		if (L > R || tag[p]) return p;
		if (l >= L && r <= R) {
			tag[p] = 1;
			sum[p] = S(l, r);
			siz[p] = r - l + 1;
			return p;
		}
		if (L <= mid) lc[p] = update(lc[q], l, mid, L, R);
		if (R > mid) rc[p] = update(rc[q], mid + 1, r, L, R);
		return pushup(p), p;
	}

	int query(int p, int l, int r, int L, int R) {
		if (L > R || l > r || l > R || r < L || tag[p]) return 0;
		if (!p) return min(r, R) - max(l, L) + 1;
		if (l >= L && r <= R) return r - l + 1 - siz[p];
		return query(lc[p], l, mid, L, R) + query(rc[p], mid + 1, r, L, R);
	}

	int find(int p, int l, int r, int k) {
		if (!p) return l + k - 1;
		int sz = mid - l + 1 - siz[lc[p]];
		if (sz >= k) return find(lc[p], l, mid, k);
		else return find(rc[p], mid + 1, r, k - sz);
	}

	#undef mid
}

#define ls (p << 1)
#define rs (p << 1 | 1)
#define mid ((l + r) >> 1)

void modify(int p, int l, int r, int L, int R, pii v) {
	if (l > R || r < L) return;
	if (l >= L && r <= R) return tr[p].eb(v), void();
	modify(ls, l, mid, L, R, v); modify(rs, mid + 1, r, L, R, v);
}

void solve(int p, int l, int r) {
	int rt = seg :: rt;
	int cnt = seg :: cnt;
	for (auto it : tr[p]) {
		int l = it.fi;
		int r = seg :: find(seg :: rt, 1, M, it.se + seg :: query(seg :: rt, 1, M, 1, it.fi - 1));
		seg :: rt = seg :: update(seg :: rt, 1, M, l, r);
	}
	if (l == r) cout << seg :: sum[seg :: rt] << '\n';
	else solve(ls, l, mid), solve(rs, mid + 1, r);
	for (int i = cnt + 1; i <= seg :: cnt; ++i) {
		seg :: lc[i] = 0;
		seg :: rc[i] = 0;
		seg :: siz[i] = 0;
		seg :: sum[i] = 0;
		seg :: tag[i] = 0;
	}
	seg :: rt = rt; 
	seg :: cnt = cnt;
}

#undef ls
#undef rs
#undef mid
signed main() {
	#ifndef ONLINE_JUDGE
		freopen("test.in", "r", stdin);
		freopen("test.out", "w", stdout);
	#endif
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		int a, b; cin >> a >> b;
		if (mp.count(a)) modify(1, 1, n, mp[a].se, i - 1, pii(a, mp[a].fi));
		mp[a] = pii(b, i);
	}
	for (auto it : mp) modify(1, 1, n, it.se.se, n, pii(it.fi, it.se.fi));
	solve(1, 1, n);
	return 0;
}