#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const ll MOD = 998244353;
const double INFD = 1.0E10;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
//const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using Pair = pair<ll, ll>;
using Graph = vector<vector<int>>;
using mint = atcoder::modint998244353;



int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    
    ll n; cin >> n;
    vector<ll> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
    
    vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, -INFLL));
    dp[n][0] = 0;
    for (int i = n - 1; i >= 0; i--){
        for (int j = 0; j <= n; j++){
            if (j < n) dp[i][j + 1] = max(dp[i][j + 1], dp[i + 1][j] + b[i]);
            dp[i][j] = max(dp[i][j], dp[i + 1][j] + a[i] * j);
        }
        
        //for (int j = 0; j <= n; j++) cerr << dp[i][j] << (j == n ? '\n' : ' ');
    }
    
    ll ans = 0;
    for (int i = 0; i <= n; i++) ans = max(ans, dp[0][i]);
    cout << ans << endl;

    return 0;
}