#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)


ll a[2010],c[2010];
ll dp[2010][2010];


int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;

	ll N;
	string S;
	cin >> N >> S;
	for(i=1;i<=2*N;i++) cin >> a[i];

	REP(i,2*N){
		if(S[i]=='(') c[i+1]=1;
		else c[i+1]=-1;
	}

	REP(i,2*N+1) REP(j,2*N+1) dp[i][j]=1e13;

	dp[0][0]=0;
	for(i=1;i<=2*N;i++){
		for(j=0;j<=2*N;j++){
			if(c[i]==1){
				if(j-1>=0 && dp[i-1][j-1]!=1e13) dp[i][j]=min(dp[i][j],dp[i-1][j-1]);
				if(j+1<=2*N && dp[i-1][j+1]!=1e13) dp[i][j]=min(dp[i][j],dp[i-1][j+1]+a[i]);

			}else{
				if(j-1>=0 && dp[i-1][j-1]!=1e13) dp[i][j]=min(dp[i][j],dp[i-1][j-1]+a[i]);
				if(j+1<=2*N && dp[i-1][j+1]!=1e13) dp[i][j]=min(dp[i][j],dp[i-1][j+1]);

			}
		}
	}


	cout << dp[2*N][0] << endl;


	return 0;
}