//TLE Θ(N^3)

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

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>
#include <unordered_map>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

//using mint = modint998244353;
#define rep(i,n) for (int i=0;i<n;i+=1)
#define rrep(i,n) for (int i=n-1;i>-1;i--)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<endl;
}

ll lpow(int n,int k){
  ll res = 1;
  ll e = n;
  while (k){
    if (k&1){
      res *= e;
    }
    e = e * e;
    k >>= 1;
  }
  return res;
}

ll dp[2501][2501];
pair<int,ll> deq[2501];
ll INF = 1e17;

int l = 0, r = 0;

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);


  int N;
  cin>>N;
  rep(i,N+1){
      rep(j,N+1){
          dp[i][j] = -INF;
      }
  }
  dp[0][0] = 0;
  vec<pair<int,ll>> item;
  rep(i,N){
      int c;
      ll v;
      cin>>c>>v;
      item.append({c,v});
  }

  rep(i,2501){
      deq[i] = {-1,-INF};
  }

  

  rep(i,N){
      auto [c,v] = item[i];
      for (int w_start=0;w_start<i+1;w_start++){
          for (int k_start=0;k_start<N+1;k_start++){
              for (int k=k_start;k<N+1;k++){
                  int w = w_start + (k-k_start) * (i+1);
                  if (N < w){
                      break;
                  }
                  if (l!=r && deq[l].first < k-c){
                      deq[l] = {-1,-INF};
                      l++;
                  }
                  ll tmp = dp[w][k] - k * v;
                  while (l!=r && deq[l].second <= tmp){
                      deq[r] = {-1,-INF};
                      r--;
                  }
                  deq[r] = {k,tmp};
                  r++;
                  dp[w][k] = v*k + deq[l].second;
              }
              for (int j=l;j<r;j++){
                  deq[j] = {-1,-INF};
              }
              l = 0,r = 0;
          }
      }

      for (int w_start=i+1;w_start<N+1;w_start++){
          for (int k_start=0;k_start<1;k_start++){
              for (int k=k_start;k<N+1;k++){
                  int w = w_start + (k-k_start) * (i+1);
                  if (N < w){
                      break;
                  }
                  if (l!=r && deq[l].first < k-c){
                      deq[l] = {-1,-INF};
                      l++;
                  }
                  ll tmp = dp[w][k] - k * v;
                  while (l!=r && deq[l].second <= tmp){
                      deq[r] = {-1,-INF};
                      r--;
                  }
                  deq[r] = {k,tmp};
                  r++;
                  dp[w][k] = v*k + deq[l].second;
              }
              for (int j=l;j<r;j++){
                  deq[j] = {-1,-INF};
              }
              l = 0,r = 0;
          }
      }

  }

  

  for (int k=1;k<N+1;k++){
      ll res = -INF;
      for (int w=0;w<=N;w++){
          chmax(res,dp[w][k]);
      }
      cout<<res<<endl;
  }


  
}