#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<stack>
using namespace std;
#define L long long#define rep(i,l,r) for(L i = l ; i <= r ; i ++ )const L mod = 1000000000 + 7 ;struct node {L cost ;L num ;friend bool operator < (node A , node B) {return A.cost > B.cost ;}
};L a[100050] ;
L b[100050] ;int main () {L n ;while(scanf("%lld" , &n) != EOF) {L ans = 0 ;rep(i,1,n) {L l,d ; char s[20] ;scanf("%lld%s%lld" , &l,s,&d) ;a[i] = l ;b[i] = d ;if(s[0] == '(') {ans += a[i] * b[i] ;b[i] *= -1 ;}}priority_queue<node> q ;L sum = 0 ;rep(i,1,n) {node c ;c.num = a[i] ;c.cost = b[i] ;q.push(c) ;sum -= c.num ;if(sum >= 0) continue ;L ned = sum * (-1) ;ned ++ ; ned /= 2 ;sum += ned * 2;while(ned > 0) {node c = q.top() ; q.pop() ;if(c.num >= ned) {c.num -= ned ;ans += ned * c.cost ;q.push(c) ;ned = 0 ;}else {ned -= c.num ;ans += c.num * c.cost ;}}}printf("%lld\n" , ans) ;}
}

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<stack>
using namespace std;
#define L long long#define rep(i,l,r) for(L i = l ; i <= r ; i ++ )const L mod = 1000000000 + 7 ;L n , m ;L a[22] ;
L b[505] ;L dp[505][505][22] ;
L s[505][505][22] ;L lowbit(L x) {return (x & (-x)) ;
}void add(L x,L j,L k,L val) {while(x <= m) {s[x][j][k] += val ;while(s[x][j][k] < 0) s[x][j][k] += mod ;s[x][j][k] %= mod ;x += lowbit(x) ;}
}
L sum(L x,L j,L k) {L sum = 0 ;while(x) {sum += s[x][j][k] ;sum %= mod ;x -= lowbit(x) ;}return sum ;
}
void upda(L l,L r,L val,L j,L k) {add(l,j,k,val) ;add(r+1,j,k,-val) ;
}int main () {while(cin >> n >> m) {rep(i,1,n) cin >> a[i] ;rep(i,1,m) cin >> b[i] ;memset(dp, 0, sizeof(dp)) ;memset(s, 0, sizeof(s)) ;L ans = 0 ;for(L i = 1 ; i <= m ; i ++ ) {for(L j = 1 ; j <= m ; j ++ ) {for(L k = 1 ; k <= n ; k ++ ) {if(k == 1) {L bord ;if(a[1] == 0) bord = m ;else bord = 1 ;if (bord != j) continue ;dp[i][bord][1] = 1 ;if (k == n){ans += dp[i][j][k];ans %= mod ;}} else {dp[i][j][k] = sum(b[i], j, k);if (k == n){ans += dp[i][j][k];ans %= mod ;}}}}for(L j = 1 ; j <= m ; j ++ ) {for(L k = 1 ; k <= n ; k ++ ) {if(k == 1) {L bord ;if(a[1] == 0) bord = m ;else bord = 1 ;if (bord != j) continue ;L x = min(bord,b[i]) ;L y = max(bord,b[i]) ;if(a[2] == 0) {upda(x,y,1,y,2) ;} else {upda(x,y,1,x,2) ;}} else {L x = min(j, b[i]);L y = max(j, b[i]);if (dp[i][j][k] == 0) continue;if (a[k + 1] == 0) {upda(x, y, dp[i][j][k], y, k + 1);} else {upda(x, y, dp[i][j][k], x, k + 1);}}}}}printf("%lld\n" , ans) ;}
}