#include <bits/stdc++.h>

#pragma GCC optimize("O3")
#define int long long

using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	int n;
	cin >> n;
	vector<int> c(n);
	for(int &x : c) cin >> x;
	string s, t;
	cin >> s >> t;
	vector<int> bad, one, zero;
	for(int i = 0; i < n; i++){
		if(s[i] == '1' && t[i] == '1') bad.emplace_back(c[i]);
		if(s[i] == '1' && t[i] == '0') one.emplace_back(c[i]);
		if(s[i] == '0' && t[i] == '1') zero.emplace_back(c[i]);
	}
	sort(bad.rbegin(),bad.rend());
	sort(one.rbegin(),one.rend());
	sort(zero.begin(),zero.end());
	int opt = 1000000000000000000ll;
	for(int i = 0; i <= sz(bad); i++){ // take i from bad
		int cur = 0, cost = 0;
		for(int l = 0; l < n; l++) if(s[l] == '1') cost += c[l];
		int j = 0, k = 0;
		for(int l = 0; l < i+sz(one); l++){
			if(j < i && (k == sz(one) || bad[j] > one[k])){
				cost -= bad[j];
				cur += cost;
				j++;
			} else{
				cost -= one[k];
				cur += cost;
				k++;
			}
		}
		j = i-1, k = 0;
		for(int l = 0; l < i+sz(zero); l++){
			if(j >= 0 && (k == sz(zero) || bad[j] < zero[k])){
				cost += bad[j];
				cur += cost;
				j--;
			} else{
				cost += zero[k];
				cur += cost;
				k++;
			}
		}
		opt = min(opt, cur);
	}
	cout << opt << "\n";
}