#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N;cin>>N;
    vector<array<ll,3>> S(N+N);
    for(int i=0;i<N+N;i++){
        char c;cin>>c;
        ll l,r;cin>>l>>r;
        if(c=='(') S[i]={0,l,r};
        else S[i]={1,r,l};
    }
    ll a=0,b=0;
    priority_queue<ll> PQ;
    for(int i=0;i<N;i++){
        PQ.push(0);
    }
    ll ans=0,la=0;
    
    vi wh(N+N);
    
    for(int i=si(S)-1;i>=0;i--){
        auto [t,l,r]=S[i];
        if(t==0) a++;
        else b++;
        if(min(a,b)>la){
            la=min(a,b);
            wh[i]++;
        }
    }
    
    for(int i=0;i<si(S);i++){
        auto [t,l,r]=S[i];
        ans+=l;
        PQ.push(r-l);
        if(wh[i]){
            ans+=PQ.top();PQ.pop();
        }
    }
    
    cout<<ans<<endl;
}