#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, char> P;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

ll dp[1<<18],a[18];
int x,f[18];

int main(void){
	int n,i,j;
	ll ans = INFLL;
	bool flag;
	fill(&dp[1],&dp[1<<18],INFLL);
	cin >> n;
	for(i=0; i<n; ++i){
		for(j=0; j<n; ++j){
			cin >> x;
			f[i] += (x<<j);
		}
	}
	for(i=0; i<n; ++i){
		cin >> a[i];
	}
	for(i=0; i<(1<<n); ++i){
		flag = true;
		for(j=0; j<n; ++j){
			if((i&f[j])!=f[j]){
				flag = false;
				break;
			}
		}
		if(flag){
			ans = min(ans,dp[i]);
		}
		for(j=0; j<n; ++j){
			if(i&(1<<j)){
				continue;
			}
			dp[i+(1<<j)] = min(dp[i+(1<<j)],dp[i]+(((i&f[j])==f[j])?0ll:a[j]));
		}
	}
	cout << dp[(1<<j)-1] << endl;
	return 0;
}