#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long inf = 1000000000000000000;
int main() {
  cin.tie(0); cout.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  string S;
  cin >> S;
  vector<int> A(2 * N);
  for(int i = 0; i < 2 * N; i++) {
    cin >> A[i];
  }
  vector<long long> dp(2 * N + 1, inf);
  dp.front() = 0;
  for(int i = 0; i < 2 * N; i++) {
    vector<long long> ndp(2 * N + 1, inf);
    for(int j = 0; j < 2 * N; j++) {
      if(S[i] == '(') {
        ndp[j + 1] = min(ndp[j + 1], dp[j]);
      } else {
        ndp[j + 1] = min(ndp[j + 1], dp[j] + A[i]);
      }
      if(j > 0) {
        if(S[i] == ')') {
          ndp[j - 1] = min(ndp[j - 1], dp[j]);
        } else {
          ndp[j - 1] = min(ndp[j - 1], dp[j] + A[i]);
        }  
      }
    }
    swap(dp, ndp);
  }
  cout << dp.front() << '\n';
  return 0;
}