#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> X(N);
	REP(i, N) {
		REP(j, N) {
			int x;
			scanf("%d", &x);
			X[i] |= x << j;
		}
	}
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	
	vector<int> dp(1 << N, INF);
	dp[0] = 0;
	
	REP(i, 1 << N) {
		if (dp[i] == INF) continue;
		REP(j, N) {
			if (i >> j & 1) continue;
			if ((i & X[j]) == X[j]) { chmin(dp[i | 1 << j], dp[i]); break; }
			chmin(dp[i | 1 << j], dp[i] + A[j]);
		}
	}
	
	cout << dp[~(~0 << N)] << endl;
}