#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<i64(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

void testcase(){
    i64 N; cin >> N; N *= 2;
    vector<i64> C(N), L(N), R(N);
    rep(i,N){
        char c; cin >> c;
        C[N-1-i] = (c == '(' ? 1 : -1);
        cin >> R[N-1-i] >> L[N-1-i];
    }
    i64 soko = 0;
    i64 d = 0;
    priority_queue<i64> que;
    i64 ans = 0;
    rep(i,N){
        soko -= 1;
        d += C[i];
        que.push(C[i] == -1 ? (L[i] - R[i]) : (R[i] - L[i]));
        ans += C[i] == -1 ? R[i] : L[i];
        while(soko < abs(d)){
            ans += que.top(); que.pop();
            soko += 2;
        }
    }
    while(que.size() && que.top() > 0){ ans += que.top(); que.pop(); }
    cout << ans << "\n";
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    rep(t,1) testcase();
    return 0;
}