import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

int N;
Tuple!(long, "a", long, "b")[] P;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      P.length = N;
      foreach (i; 0 .. N) {
        P[i].a = readLong();
        P[i].b = readLong();
      }
      
      P.sort!((p0, p1) => (p0.b > p1.b));
      const K = (N * 2 + 2) / 3;
      auto dp = new long[K + 1];
      dp[] = INF;
      dp[0] = 0;
      foreach (i; 0 .. N) {
        foreach_reverse (k; 0 .. K) {
          chmin(dp[k + 1], dp[k] + (P[i].a + P[i].b * k));
        }
      }
      writeln(dp[K]);
    }
  } catch (EOFException e) {
  }
}