#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
constexpr long long INF = 1e18;
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)

int dp[1ll << 18];

signed main(){
	IOS();
	int N;
	cin >> N;
	vector<vector<int>>x(N,vector<int>(N));
	REP(i,N)REP(j,N)cin>>x[i][j];
	vector<int>a(N);
	REP(i,N)cin>>a[i];
	vector<int>sum(1ll << N);
	REP(i,1ll<<N){
		int t = 0;
		REP(j,N){
			if(i & (1ll << j))t += a[j];
		}
		sum[i] = t;
	}
	vector<int>bit(N);
	REP(i,N){
		REP(j,N){
			if(x[i][j])bit[i] |= 1ll << j;
		}
	}
	REP(i,1ll<<N)dp[i] = INF;
	REP(i,1ll<<N){
		CHMIN(dp[i],sum[i]);
		REP(j,N){
			if(i&(1ll<<j))continue;
			if((bit[j]&i)==bit[j])CHMIN(dp[i^(1ll<<j)],dp[i]);
		}
	}
	cout<<dp[(1ll<<N)-1]<<endl;
	/*REP(i,1ll<<N){
		cout<<i<<" "<<dp[i]<<endl;
	}*/
}