//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 2010;

//head

int n;
P ab[N];
int pp[N];
int u, tada;
ll dp[N][N];

bool comp(const P &a, const P &b) {
  return a.second > b.second;
}


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  rep(i, n) cin >> ab[i];
  sort(ab, ab+n, comp);

  tada = n/3;
  u = n-tada;


  rep(i, n) {
    rep(j, min(u, i+1)) {
      if(j == i) dp[i+1][j+1] = dp[i][j] + ab[i].first + (ll)ab[i].second*i;
      else {
        dp[i+1][j+1] = min(dp[i][j+1], dp[i][j] + ab[i].first + (ll)ab[i].second*j);
      }
    }
  }

  cout << dp[n][u] << endl;
}