#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000000

#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")

long long dp[2505][2505],ndp[2505][2505];
bool f[2505][2505];
vector<vector<long long>> get(vector<int> x,vector<int> c,vector<long long> v,int C,int W){
	rep(i,C+1){
		rep(j,W+1)dp[i][j] = -Inf;
	}
	dp[0][0] = 0;
	
	rep(i,x.size()){
		//cout<<i<<endl;
		rep(j,C+1){
			rep(k,W+1){
				ndp[j][k] = -Inf;
				f[j][k] = false;
			}
		}
		
		rep(j,C+1){
			rep(k,W+1){
				
				if(f[j][k])continue;
				if(k+x[i]>W){
					ndp[j][k] = max(ndp[j][k],dp[j][k]);
					continue;
				}
				deque<pair<long long,int>> D;
				int jj = j,kk = k;
				while(true){
					if(jj>C||kk>W)break;
					f[jj][kk] = true;
					
					while(D.size()>0&&jj - D.front().second > c[i])D.pop_front();
					if(dp[jj][kk]!=-Inf){
						while(D.size()>0 && D.back().first<=dp[jj][kk] - v[i] * jj)D.pop_back();
						D.emplace_back(dp[jj][kk] - v[i] * jj, jj);
					}
					
					if(D.size()>0)ndp[jj][kk] = max(ndp[jj][kk],v[i]*jj + D.front().first);
					
					jj++;
					kk+=x[i];
				}
				
			}
		}
		swap(dp,ndp);
	}
	vector<vector<long long>> ret(C+1,vector<long long>(W+1));
	rep(i,ret.size()){
		rep(j,ret[i].size())ret[i][j] = dp[i][j];
	}
	return ret;
	
}

int main() {
    
	int N;
	cin>>N;
	
	vector<int> c(N+1);
	vector<long long> v(N+1);
	rep(i,N){
		cin>>c[i+1]>>v[i+1];
		c[i+1] = min(c[i+1],N/(i+1));
		v[i+1] += 1000000000;
	}
	
	vector<int> xx,cc;
	vector<long long> vv;
	for(int i=1;i<=min(N,50);i++){
		xx.push_back(i);
		cc.push_back(c[i]);
		vv.push_back(v[i]);
	}
	//cout<<'a'<<endl;
	auto dpx = get(xx,cc,vv,N+1,N+1);
	
	xx.resize(0),cc.resize(0),vv.resize(0);
	for(int i=51;i<=N;i++){
		xx.push_back(i);
		cc.push_back(c[i]);
		vv.push_back(v[i]);
	}
	
	auto dpy = get(xx,cc,vv,51,N+1);
	
	rep(i,dpx.size()){
		rep(j,N)dpx[i][j+1] = max(dpx[i][j+1],dpx[i][j]);
	}
	rep(i,dpy.size()){
		rep(j,N)dpy[i][j+1] = max(dpy[i][j+1],dpy[i][j]);
	}
	vector<long long> ans(N+1,-Inf);
	rep(i,dpx.size()){
		rep(j,dpy.size()){
			if(i+j>N)break;
			rep(k,N+1){
				ans[i+j] = max(ans[i+j],dpx[i][k] + dpy[j][N-k]);
			}
		}
	}
	rep(i,N){
		ans[i+1] -= 1000000000LL * (i+1);
		cout<<ans[i+1]<<endl;
	}
				
	
    return 0;
}