#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

bool get_bit(ll bit, ll idx) {
    return ((bit & (1LL << idx)) != 0);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<vector<ll>> x(n, vector<ll>(n));
    rep(i, n) rep(j, n) cin >> x[i][j];
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    ll ans = LONG_LONG_MAX;
    rep(bit, 1LL << n) {
        set<ll> rem, out;
        ll tmp = 0;
        rep(i, n) {
            if (get_bit(bit, i)) {
                out.insert(i);
                tmp += a[i];
            }
            else {
                rem.insert(i);
            }
        }
        bool updated = true;
        while(updated) {
            updated = false;
            for(auto it = rem.begin(); it != rem.end(); ) {
                ll t = *it;
                bool clear = true;
                rep(i, n) {
                    if ((x[t][i] == 1) && (rem.count(i) > 0)) {
                        clear = false;
                        break;
                    }
                }
                if (clear) {
                    rem.erase(it++);
                    updated = true;
                }
                else {
                    it++;
                }
            }
        }
        if (sz(rem) == 0) {
            ans = min(ans, tmp);
        }
    }
    cout << ans << endl;
    return 0;
}