#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  struct S {
    char c;
    int l, r;
  };
  vector<S> clr(2 * n);
  for (auto& [c, l, r] : clr) cin >> c >> l >> r;
  int inc = 0, height = 0;
  ll ans = 0;
  priority_queue<int> q;
  for (auto [c, l, r] : clr | views::reverse) {
    if (c == '(') {
      if (inc > 0) {
        if (l > r) {
          ans += l;
          height++;
        } else {
          ans += r;
          q.emplace(l - r);
        }
      } else {
        if (l > r) {
          ans += l;
        } else {
          ans += r;
          height--;
          q.emplace(l - r);
        }
      }
      inc--;
    } else {
      if (inc < 0) {
        if (l > r) {
          ans += l;
          q.emplace(r - l);
        } else {
          ans += r;
          height++;
        }
      } else {
        if (l > r) {
          ans += l;
          height--;
          q.emplace(r - l);
        } else {
          ans += r;
        }
      }
      inc++;
    }
    if (height == -1) {
      ans += q.top(); q.pop();
      height++;
    }
  }
  cout << ans << '\n';
}