#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
const ll INF=1e18;
ll dp[2020][2020]; 
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  rep(i,2020) rep(j,2020) dp[i][j]=INF;
  dp[0][0]=0;
  
  int n;
  string s;
  cin>>n>>s;
  vector<ll> A(2*n);
  rep(i,2*n) cin>>A[i];
  rep(i,2*n){
    for(int j=0;j<=n;j++)
    if(s[i]=='('){
      if(j+1<=n) dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]);
      if(j-1>=0) dp[i+1][j-1]=min(dp[i+1][j-1],dp[i][j]+A[i]);
    }
    else{
      if(j+1<=n) dp[i+1][j+1]=min(dp[i+1][j+1],dp[i][j]+A[i]);
      if(j-1>=0) dp[i+1][j-1]=min(dp[i+1][j-1],dp[i][j]);
    }
  }
  cout<<dp[2*n][0]<<endl;
    
  return 0;
}