#include <iostream>
#include <algorithm>

using namespace std;

using ll = long long;

constexpr ll INF = 2.1e12;

int main() {
    int n;
    cin >> n;
    char s[2*n+1];
    for (int i = 1; i <= 2 * n; i++) {
        cin >> s[i];
    }
    int a[2*n+1];
    for (int i = 1; i <= 2 * n; i++) {
        cin >> a[i];
    }

    ll dp[2*n+1][n+1];
    fill(dp[0], dp[2*n+1], INF);
    dp[0][0] = 0;
    for (int i = 1; i <= 2 * n; i++) {
        for (int j = 0; j <= n; j++) {
            if (j > 0) {
                dp[i][j] = min(dp[i][j], dp[i-1][j-1] + a[i] * (s[i] != '('));
            }
            if (j < n) {
                dp[i][j] = min(dp[i][j], dp[i-1][j+1] + a[i] * (s[i] != ')'));
            }
        }
    }

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

    return 0;
}