#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>a(n), b(n);
	rep(i, n)cin >> a[i] >> b[i];
	vector dp(n + 1, vector<long long>(n + 10, -LINF));
	dp[n][0] = 0;// このあとのattの回数とダメージのmax??
	rrep2(i, 1, n + 1) {
		rep(j, n + 1) {
			if (dp[i][j] < 0)continue;
			// att
			{
				long long val = dp[i][j];
				val += b[i - 1];
				chmax(dp[i - 1][j + 1], val);
			}
			// charge
			{
				long long val = dp[i][j];
				val += a[i - 1] * j;
				chmax(dp[i - 1][j], val);
			}
		}
	}
	long long ans = 0;
	rep(i, n + 1) chmax(ans, dp[0][i]);
	cout << ans << endl;
	return 0;
}