#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll N;
vector<vector<int>> g;
vector<ll> A;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	scanf("%lld", &N);
	g = vector<vector<int>>(N, vector<int>(N));
	for (ll i = 0; i < N; i++) for (ll j = 0; j < N; j++) scanf("%d", &g[i][j]);
	A = vector<ll>(N); for (ll i = 0; i < N; i++) scanf("%lld", &A[i]);
	ll res = INF;
	vector<ll> mask(N);
	for (ll i = 0; i < N; i++) {
		for (ll j = 0; j < N; j++) {
			if (g[i][j]) {
				mask[i] += (1LL << j);
			}
		}
	}
	for (ll S = 0; S < (1LL << N); S++) {
		ll tmp = 0;
		ll TS = S;
		for (ll i = 0; i < N; i++) {
			if((TS >> i) & 1) tmp += A[i];
		}


		for (ll i = 0; i < N; i++) {
			for (ll j = 0; j < N; j++) {
				ll a = (TS & mask[j]);
				if (a == mask[j]) {
					TS = (TS | (1LL << j));
				}
			}
			if (TS == (1LL << N) - 1) break;
		}
		if (TS == (1LL << N) - 1) chmin(res, tmp);
	}
	cout <<res<<endl;
	return 0;
}