// Problem: P9130 [USACO23FEB] Hungry Cow P
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P9130
// Memory Limit: 512 MB
// Time Limit: 6000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define f(l, r) (((l + r) % mod) * ((r - l + 1) % mod) * inv2 % mod)
#define pb emplace_back
#define fst first
#define scd second
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 100100;
const ll N = (ll)1.2e15;
const ll mod = 1000000007;
const ll inv2 = (mod + 1) / 2;

bool test1;
int n, ls[maxn * 150], rs[maxn * 150], ntot, rt[maxn];
ll ans[maxn];
vector<pii> vc[maxn << 2];
struct node {
	ll val, cnt;
	bool tag;
} tree[maxn * 150];
bool test2;

void pushup(int x, ll l, ll r) {
	if (tree[x].tag) {
		tree[x].cnt = r - l + 1;
		tree[x].val = f(l, r);
	} else {
		tree[x].cnt = tree[ls[x]].cnt + tree[rs[x]].cnt;
		tree[x].val = (tree[ls[x]].val + tree[rs[x]].val) % mod;
	}
}

int update(int rt, ll l, ll r, ll ql, ll qr) {
	int u = ++ntot;
	ls[u] = ls[rt];
	rs[u] = rs[rt];
	tree[u] = tree[rt];
	if (ql <= l && r <= qr) {
		tree[u].tag = 1;
		tree[u].cnt = r - l + 1;
		tree[u].val = f(l, r);
		assert(tree[u].val >= 0);
		return u;
	}
	ll mid = (l + r) >> 1;
	if (ql <= mid) {
		ls[u] = update(ls[u], l, mid, ql, qr);
	}
	if (qr > mid) {
		rs[u] = update(rs[u], mid + 1, r, ql, qr);
	}
	pushup(u, l, r);
	return u;
}

ll query(int rt, ll l, ll r, ll ql, ll qr, bool fl = 0) {
	if (!rt) {
		return fl ? min(qr, r) - max(ql, l) + 1 : 0;
	}
	fl |= tree[rt].tag;
	if (ql <= l && r <= qr) {
		return (fl ? r - l + 1 : tree[rt].cnt);
	}
	ll mid = (l + r) >> 1, res = 0;
	if (ql <= mid) {
		res += query(ls[rt], l, mid, ql, qr, fl);
	}
	if (qr > mid) {
		res += query(rs[rt], mid + 1, r, ql, qr, fl);
	}
	return res;
}

ll find(int rt, ll l, ll r, ll x, bool fl = 0) {
	if (!rt) {
		return l + x - 1;
	}
	if (l == r) {
		return l;
	}
	fl |= tree[rt].tag;
	ll mid = (l + r) >> 1;
	ll tmp = (fl ? 0 : mid - l + 1 - tree[ls[rt]].cnt);
	return x <= tmp ? find(ls[rt], l, mid, x, fl) : find(rs[rt], mid + 1, r, x - tmp, fl);
}

void insert(int rt, int l, int r, int ql, int qr, pii x) {
	if (ql <= l && r <= qr) {
		vc[rt].pb(x);
		return;
	}
	int mid = (l + r) >> 1;
	if (ql <= mid) {
		insert(rt << 1, l, mid, ql, qr, x);
	}
	if (qr > mid) {
		insert(rt << 1 | 1, mid + 1, r, ql, qr, x);
	}
}

void dfs(int u, int l, int r) {
	int lsttot = ntot;
	rt[u] = rt[u >> 1];
	for (pii p : vc[u]) {
		ll pos = find(rt[u], 1, N, p.scd + p.fst - 1 - query(rt[u], 1, N, 1, p.fst - 1));
		rt[u] = update(rt[u], 1, N, p.fst, pos);
	}
	if (l == r) {
		ans[l] = tree[rt[u]].val;
	} else {
		int mid = (l + r) >> 1;
		dfs(u << 1, l, mid);
		dfs(u << 1 | 1, mid + 1, r);
	}
	for (int i = lsttot + 1; i <= ntot; ++i) {
		ls[i] = rs[i] = 0;
		tree[i].val = tree[i].cnt = tree[i].tag = 0;
	}
	ntot = lsttot;
}

void solve() {
	scanf("%d", &n);
	map<ll, pii> mp;
	for (int i = 1; i <= n; ++i) {
		ll x, y;
		scanf("%lld%lld", &x, &y);
		if (mp.find(x) != mp.end()) {
			insert(1, 1, n, mp[x].scd, i - 1, make_pair(x, mp[x].fst));
		}
		mp[x] = make_pair(y, i);
	}
	for (auto p : mp) {
		insert(1, 1, n, p.scd.scd, n, make_pair(p.fst, p.scd.fst));
	}
	dfs(1, 1, n);
	for (int i = 1; i <= n; ++i) {
		printf("%lld\n", ans[i]);
	}
}

int main() {
	fprintf(stderr, "%.2lf MB\n", (&test2 - &test1) / 1048576.);
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}