#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000000
#define Inf64 1000000000000000001LL

int main(){
	
	int n;
	cin>>n;
	
	vector<char> c(n*2);
	vector<long long> l(n*2),r(n*2);
	rep(i,n*2){
		cin>>c[i]>>l[i]>>r[i];
	}
	
	long long ans = 0;
	reverse(c.begin(),c.end());
	reverse(l.begin(),l.end());
	reverse(r.begin(),r.end());
	
	priority_queue<long long,vector<long long>,greater<long long>> q,q2;
	int x = 0, y=0;
	rep(i,n*2){
		if(c[i]=='('){
			if(l[i]>=r[i]){
				ans += l[i];
				x++;
			}
			else{
				y--;
				ans += r[i];
				q.push(r[i]-l[i]);
				if(y<0){
					y++;
					x++;
					ans -= q.top();
					q.pop();
				}
			}
		}
		else{
			if(l[i]<=r[i]){
				ans += r[i];
				y++;
			}
			else{
				x--;
				ans += l[i];
				q.push(l[i]-r[i]);
				if(x<0){
					x++;
					y++;
					ans -= q.top();
					q.pop();
				}
			}
		}
		//cout<<ans<<endl;
	}
	cout<<ans<<endl;
	return 0;
}