#include <bits/stdc++.h>
using namespace std;
int n, x, y, vis[1000005];
map<int, int> mp;

int main() {
	scanf("%d", &n);
	for(int i = 1;i <= n;i++) {
		long long ans = 0;
		scanf("%d%d", &x, &y);
		mp[x] = y;
		for(pair<int, int> j : mp) {
			int now = j.first, cnt = 0;
			if(j.second == 0) continue;
			while(1) {
				if(!vis[now]) vis[now] = 1, cnt ++, ans += now;
				if(cnt == j.second) break;
				now ++;
			}
		}
		memset(vis, 0, sizeof(vis));
		printf("%lld\n", ans);
	}
}