import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto C = new char[2*N];
      auto L = new long[2*N];
      auto R = new long[2*N];
      foreach (i; 0 .. 2*N) {
        C[i] = readToken[0];
        L[i] = readLong;
        R[i] = readLong;
      }
      
      auto ds = new int[2*N + 1];
      foreach (i; 0 .. 2*N) {
        ds[i + 1] = ds[i] + ((C[i] == ')') ? -1 : +1);
      }
      
      debug {
        auto dp = new long[][2*N + 1];
        foreach (i; 0 .. 2*N + 1) {
          dp[i] = new long[N + 1];
          dp[i][] = -INF;
        }
        dp[0][0] = 0;
        foreach (i; 0 .. 2*N) {
          foreach (u; 0 .. N + 1) if (dp[i][u] >= 0) {
            int vL, vR;
            if (C[i] == '(') {
              vL = (u == 0) ? u : (u - 1);
              vR = u;
            } else {
              vL = u + 1;
              vR = (u == -ds[i]) ? (u + 1) : u;
            }
            chmax(dp[i + 1][vL], dp[i][u] + L[i]);
            chmax(dp[i + 1][vR], dp[i][u] + R[i]);
          }
        }
        foreach (i; 0 .. 2*N + 1) {
          writeln(i, ": ", ds[i], " ", dp[i]);
        }
        const brt = dp[2*N][0];
        writeln("brt = ", brt);
      }
      
      int uL, uR;
      auto slopes = new RedBlackTree!(long, "a < b", true);
      long ans;
      foreach (i; 0 .. 2*N) {
        debug writeln([uL, uR], " ", slopes, " ", ans);
        if (C[i] == '(') {
          assert(0 <= uL);
          slopes.insert(R[i] - L[i]);
          ans += L[i];
          if (0 == uL) {
            const s = slopes.back;
            slopes.removeKey(s);
            ans += max(s, 0);
          } else {
            --uL;
          }
        } else {
          assert(-ds[i] <= uL);
          slopes.insert(L[i] - R[i]);
          ans += R[i];
          if (-ds[i] == uL) {
            const s = slopes.back;
            slopes.removeKey(s);
            ans += max(s, 0);
            ++uL;
          }
          ++uR;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}