#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

struct node
{
	int c;
	char state, need;
	
	bool operator<(const node& n) const
	{
		return c < n.c;
	}
};

LL solve(int n, vector<node> vals)
{
	LL ans = 0;
	LL sum = 0;
	FOR(i, 0, n)
		if(vals[i].state == '1')
			sum += vals[i].c;
	
	RFOR(i, n, 0)
	{
		if(vals[i].state == '1' && vals[i].need == '0')
		{
			sum -= vals[i].c;
			ans += sum;
		}
	}
	FOR(i, 0, n)
	{
		if(vals[i].state == '0' && vals[i].need == '1')
		{
			sum += vals[i].c;
			ans += sum;
		}
	}
	return ans;
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);

	int n;
	cin >> n;
	
	vector<node> vals(n);
	FOR(i, 0, n)
		cin >> vals[i].c;
	FOR(i, 0, n)
		cin >> vals[i].state;
	FOR(i, 0, n)
		cin >> vals[i].need;
	
	sort(ALL(vals));
	
	LL ans = solve(n, vals);
	
	LL sum = 0;
	FOR(i, 0, n)
		sum += vals[i].c;
		
	LL cur = 0;
	RFOR(i, n, 0)
	{
		if(vals[i].state == '0')
			continue;
		vals[i].state = '0';
		
		sum -= vals[i].c;
		cur += sum;
		
		ans = min(ans, cur + solve(n, vals));
	}
	cout << ans << "\n";
	
	
	
	

	return 0;
}