#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
bool inside(int y,int x,int h,int w){
	if(y<h && y>=0 && x<w && x>=0) return true;
	return false;
}





int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;cin >> n;
	vector<bitset<32>> x(n);
	rep(i,n) rep(j,n){
		bool a;cin >> a;
		if(a) x[i].set(j);
	}
	vector<int> a(n);
	rep(i,n) cin >> a.at(i);
	int ans = 1000000000;
	bitset<32> all = (1 << n) - 1;
	rep(mask,(1 << n)){
		int sum = 0;
		bool ok = true;
		bitset<32> b = mask;
		rep(i,n){
			if(b[i]) sum += a.at(i);
		}
		rep(i,n){
			rep(j,n){
				if((x[j] & b) == x[j]) b.set(j);
			}
		}
		if(b == all) ans = min(ans, sum);
	}
	cout << ans << endl;
}