#include <cctype>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
using namespace std;
void solve()
{
	int N;
	string S;
	cin >> N >> S;
	vector<vector<long long>> dp(2,vector<long long>(2*N+1,(long long)1e18));
	int cur = 0;
	dp[cur][0] = 0;
	for(int i = 0;i < 2*N;i++)
	{
		int nxt = 1-cur;
		for(int j = 0;j <= i+1;j++) dp[nxt][j] = (long long)1e18;
		int A;
		cin >> A;
		for(int j = 0;j <= i;j++)
		{
			if(S[i] == '(')
			{
				dp[nxt][j+1] = min(dp[nxt][j+1],dp[cur][j]);
				if(j) dp[nxt][j-1] = min(dp[nxt][j-1],dp[cur][j] + A);
			}
			else 
			{
				if(j) dp[nxt][j-1] = min(dp[nxt][j-1],dp[cur][j]);
				dp[nxt][j+1] = min(dp[nxt][j+1],dp[cur][j] + A);
			}
		}
		swap(cur,nxt);
	}
	cout << dp[cur][0] << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}